#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
pair<long long, long long> e[N];
long long c[N];
int main() {
  int n, cnt;
  while (~scanf("%d", &n)) {
    memset(c, 0, sizeof(c));
    memset(e, 0, sizeof(e));
    for (int i = 1; i <= n; i++) {
      scanf("%lld %lld", &e[i * 2 - 1].first, &e[i * 2].first);
      e[i * 2 - 1].second = 1;
      e[i * 2].second = -1;
      e[i * 2].first++;
    }
    sort(e + 1, e + 1 + 2 * n);
    cnt = 0;
    for (int i = 1; i <= 2 * n; i++) {
      c[cnt] += e[i].first - e[i - 1].first;
      cnt += e[i].second;
    }
    for (int i = 1; i <= n; i++) {
      if (i == n)
        printf("%lld\n", c[i]);
      else
        printf("%lld ", c[i]);
    }
  }
}
