#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
const int mod = 1e9 + 9;
int Case = 1, n, m;
long long res[maxn + 5];
void solve() {
  map<long long, long long> cc;
  memset(res, 0, sizeof(res));
  cc.clear();
  cin >> n;
  for (int i = 1; i <= n; i++) {
    long long a, b;
    cin >> a >> b;
    cc[a]++;
    cc[b + 1]--;
  }
  map<long long, long long>::iterator it;
  long long pos = 0, val = 0;
  for (it = cc.begin(); it != cc.end(); it++) {
    res[val] += (*it).first - pos;
    pos = (*it).first;
    val += (*it).second;
  }
  for (int i = 1; i <= n; i++) {
    if (i == n)
      cout << res[i] << "\n";
    else
      cout << res[i] << " ";
  }
}
int main() {
  ios::sync_with_stdio(false);
  while (Case--) {
    solve();
  }
  return 0;
}
