#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005;
pair<long long, long long> e[maxn];
int ce;
long long f[maxn], n;
long long l, r, cnt;
int main() {
  cnt = 0;
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld%lld", &l, &r);
    e[++ce] = {l, 1};
    e[++ce] = {r + 1, -1};
  }
  sort(e + 1, e + 1 + ce);
  for (int i = 1; i <= ce; i++) {
    f[cnt] += e[i].first - e[i - 1].first;
    cnt += e[i].second;
  }
  for (int i = 1; i <= n; i++) {
    printf("%lld", f[i]);
    if (i != n) printf(" ");
  }
  puts("");
  return 0;
}
