#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
long long n, tot, has, a[N], l[N], r[N], g[N], rl[N], ans[N];
map<long long, long long> mp;
long long read() {
  long long r = 0, f = 1;
  char p = getchar();
  while (p > '9' || p < '0') {
    if (p == '-') f = -1;
    p = getchar();
  }
  while (p >= '0' && p <= '9') {
    r = r * 10 + p - 48;
    p = getchar();
  }
  return r * f;
}
int main() {
  n = read();
  for (long long i = 1; i <= n; i++)
    l[i] = read(), r[i] = read(), g[++tot] = l[i], g[++tot] = r[i] + 1;
  sort(g + 1, g + 1 + tot);
  for (long long i = 1; i <= tot; i++)
    if (i == 1 || g[i] != g[i - 1]) mp[g[i]] = ++has, rl[has] = g[i];
  for (long long i = 1; i <= n; i++) a[mp[l[i]]]++, a[mp[r[i] + 1]]--;
  for (long long i = 2; i <= has; i++) a[i] += a[i - 1];
  for (long long i = 1; i < has; i++) ans[a[i]] += rl[i + 1] - rl[i];
  for (long long i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
