#include <bits/stdc++.h>
using namespace std;
typedef struct P {
  long long x;
  long long y;
} p;
p f[400005];
long long cnt[200005];
long long n;
bool cmp(p x, p y) { return x.x < y.x; }
int main() {
  int i;
  long long x, y, t = 1;
  scanf("%I64d", &n);
  for (i = 0; i < 2 * n; i += 2) {
    scanf("%I64d%I64d", &x, &y);
    f[i].x = x;
    f[i].y = 1;
    f[i + 1].x = y + 1;
    f[i + 1].y = -1;
  }
  sort(f, f + 2 * n, cmp);
  for (i = 1; i < 2 * n; i++) {
    cnt[t] += f[i].x - f[i - 1].x;
    t += f[i].y;
  }
  for (i = 1; i <= n; i++) printf("%I64d ", cnt[i]);
  return 0;
}
