#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c <= '9' && c >= '0') {
    x = (x << 1) + (x << 3) + c - '0';
    c = getchar();
  }
  return w == 1 ? x : -x;
}
long long n, b[400005 << 1], cnt, f[400005], tot, ans[400005];
struct node {
  long long l, r;
} p[400005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++)
    p[i].l = read(), p[i].r = read(), p[i].r++, b[++cnt] = p[i].l,
    b[++cnt] = p[i].r;
  b[++cnt] = n;
  sort(b + 1, b + cnt + 1);
  tot = unique(b + 1, b + cnt + 1) - b - 1;
  for (int i = 1; i <= n; i++) {
    int p1 = lower_bound(b + 1, b + tot + 1, p[i].l) - b;
    int p2 = lower_bound(b + 1, b + tot + 1, p[i].r) - b;
    f[p1]++;
    f[p2]--;
  }
  int q = 0;
  for (int i = 1; i <= tot; i++) {
    ans[q] += (b[i] - b[i - 1]);
    q += f[i];
  }
  for (int i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
