#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, long long> seg[200005];
int idx = 0;
map<long long, int> ini;
long long ev[400005];
long long balik[400005];
long long val[400005];
long long cetak[400005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    long long x, y;
    cin >> x >> y;
    seg[i] = make_pair(x, y + 1);
    ev[2 * i - 1] = x;
    ev[2 * i] = y + 1;
  }
  sort(ev + 1, ev + 2 * n + 1);
  ini[ev[1]] = 1;
  idx++;
  balik[1] = ev[1];
  for (int i = 2; i <= 2 * n; i++) {
    if (ev[i] != ev[i - 1]) {
      idx++;
      ini[ev[i]] = idx;
      balik[idx] = ev[i];
    }
  }
  for (int i = 1; i <= n; i++) {
    int kiri = ini[seg[i].first];
    int kanan = ini[seg[i].second];
    val[kiri]++;
    val[kanan]--;
  }
  for (int i = 2; i <= 400000; i++) {
    val[i] += val[i - 1];
  }
  for (int i = 2; i <= idx; i++) {
    cetak[val[i - 1]] += balik[i] - balik[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    if (i != 1) cout << " ";
    cout << cetak[i];
  }
  cout << "\n";
}
