#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int maxn = 1e6 + 5;
long long num[maxn];
struct node {
  long long p;
  int v;
  bool operator<(const node& rhs) const {
    if (p == rhs.p) return v > rhs.v;
    return p < rhs.p;
  }
} d[maxn];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    long long x, y;
    map<int, int> q;
    for (int i = 0; i < n; i++) {
      scanf("%lld%lld", &x, &y);
      d[i * 2].p = x;
      d[i * 2].v = 1;
      d[i * 2 + 1].p = y + 1;
      d[i * 2 + 1].v = -1;
    }
    sort(d, d + n * 2);
    memset(num, 0, sizeof(num));
    int now = 0;
    long long pre = -1;
    for (int i = 0; i < 2 * n; i++) {
      num[now] += d[i].p - pre;
      now += d[i].v;
      pre = d[i].p;
    }
    for (int i = 1; i <= n; i++) {
      cout << num[i];
      if (i == n)
        cout << endl;
      else
        cout << " ";
    }
  }
}
