#include <bits/stdc++.h>
using namespace std;
long long n, x, y, las, ans[1000010], w;
vector<pair<long long, long long> > tab;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int a = 1; a <= n; a++) {
    cin >> x >> y;
    tab.push_back(make_pair(x, -1));
    tab.push_back(make_pair(y, 1));
  }
  las = -1;
  sort(tab.begin(), tab.end());
  for (int a = 0; a < tab.size();) {
    long long p = tab[a].first;
    if (las >= 0) ans[w] += p - las - 1;
    while (a < tab.size() && tab[a].first == p && tab[a].second == -1) {
      w++;
      a++;
    }
    ans[w]++;
    while (a < tab.size() && tab[a].first == p && tab[a].second == 1) {
      w--;
      a++;
    }
    las = p;
  }
  for (int a = 1; a <= n; a++) cout << ans[a] << " ";
  return 0;
}
