#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
  long long pos;
  int val;
  bool friend operator<(node x, node y) { return x.pos < y.pos; }
} p[maxn << 2];
long long ans[maxn << 2];
int main() {
  int n;
  cin >> n;
  long long l, r;
  int s = 0;
  for (int t = 1; t <= n; t++) {
    scanf("%lld%lld", &l, &r);
    p[s].pos = l;
    p[s].val = 1;
    s++;
    p[s].pos = r + 1;
    p[s].val = -1;
    s++;
  }
  sort(p, p + s);
  int cc = 1;
  for (int t = 0; t < s - 1; t++) {
    ans[cc] += p[t + 1].pos - p[t].pos;
    cc += p[t + 1].val;
  }
  for (int t = 1; t <= n; t++) {
    printf("%lld ", ans[t]);
  }
  return 0;
}
