#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
map<long long, int> mp;
long long cnt[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    long long l, r;
    cin >> l >> r;
    if (mp.find(l) == mp.end()) mp[l] = 0;
    if (mp.find(r) == mp.end()) mp[r] = 0;
    if (mp.find(r + 1) == mp.end()) mp[r + 1] = 0;
    mp[l]++;
    mp[r + 1]--;
  }
  map<long long, int>::iterator it = mp.begin(), its = mp.begin();
  for (++it; it != mp.end(); it++, its++) {
    it->second += its->second;
  }
  its = it = mp.begin();
  for (it++; it != mp.end(); it++, its++) {
    long long tmp = it->first - its->first;
    cnt[its->second] += tmp;
  }
  for (int i = 1; i <= n; i++) {
    cout << cnt[i] << " ";
  }
  cout << endl;
  return 0;
}
