#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
const long long P = 1000000007;
const long long mod = 998244353;
long long n, m;
vector<pair<long long, long long>> v;
vector<long long> cnt;
int main() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long l, r;
    scanf("%lld %lld", &l, &r);
    v.push_back({l, -1});
    v.push_back({r, 1});
  }
  sort(v.begin(), v.end());
  long long cur = 0;
  cnt.resize(n + 1, 0);
  pair<long long, long long> pre = {v[0]};
  for (auto ev : v) {
    if (ev.second < 0) {
      if (pre.second < 0) {
        cnt[cur] += ev.first - pre.first;
      } else {
        cnt[cur] += ev.first - pre.first - 1;
      }
      cur++;
      pre = ev;
    } else {
      if (ev.first == pre.first && ev.second != pre.second) {
        cnt[cur]++;
        cur--;
        pre = ev;
      } else {
        if (ev == pre)
          cur--;
        else {
          if (pre.second < 0) {
            cnt[cur] += ev.first - pre.first + 1;
            cur--;
            pre = ev;
          } else {
            cnt[cur] += ev.first - pre.first;
            cur--;
            pre = ev;
          }
        }
      }
    }
  }
  for (long long i = 1; i <= n; i++) cout << cnt[i] << ' ';
  return 0;
}
