#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, int> buf[2 * 200001];
long long cnt[200001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= 2 * n; i += 2) {
    cin >> buf[i].first;
    buf[i].second = 0;
    cin >> buf[i + 1].first;
    buf[i + 1].second = 1;
  }
  sort(buf + 1, buf + 2 * n + 1);
  int idx = 1, now = 0;
  while (idx <= 2 * n) {
    cnt[now] += buf[idx].first - buf[idx - 1].first - 1;
    int tmp = idx;
    while (idx <= 2 * n && buf[idx].first == buf[tmp].first &&
           !buf[idx].second) {
      now++;
      idx++;
    }
    cnt[now] += 1;
    while (idx <= 2 * n && buf[idx].first == buf[tmp].first) {
      now--;
      idx++;
    }
  }
  for (int i = 1; i <= n; ++i) cout << cnt[i] << ' ';
  cout << '\n';
  return 0;
}
