#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > ar;
  for (long long i = 0; i < n; i++) {
    long long t1, t2;
    cin >> t1 >> t2;
    ar.push_back({t1, 1});
    ar.push_back({t2, 0});
  }
  sort(ar.begin(), ar.end());
  long long ans[n + 1];
  for (long long i = 0; i < n + 1; i++) ans[i] = 0;
  long long cur_seg = 0;
  long long i = 0;
  long long prev = -1;
  long long cur = -1;
  while (i < 2 * n) {
    cur = ar[i].first;
    long long cnt1 = 0;
    while (i < 2 * n && ar[i].first == cur && ar[i].second == 0) {
      cnt1++;
      i++;
    }
    long long cnt2 = 0;
    while (i < 2 * n && ar[i].first == cur && ar[i].second == 1) {
      cnt2++;
      i++;
    }
    ans[cur_seg + cnt2]++;
    if (prev != -1 && (cur - prev) > 1) {
      ans[cur_seg] += (cur - prev - 1);
    }
    cur_seg += (cnt2 - cnt1);
    prev = cur;
  }
  for (long long i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
