#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
long long tot[200010];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<long long, int> > v;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    v.push_back({l, -1});
    v.push_back({r + 1, 1});
  }
  sort(v.begin(), v.end());
  long long open = 0;
  long long last = v[0].first;
  for (int i = 0; i < v.size();) {
    long long pos = v[i].first;
    tot[open] += pos - last;
    while (i < v.size() && v[i].first == pos) {
      open -= v[i].second;
      i++;
    }
    last = pos;
  }
  for (int i = 1; i <= n; i++) cout << tot[i] << " ";
  cout << '\n';
  return 0;
}
