#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
map<long long, int> mp, mpp;
long long ans[200005];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    if (!mpp[l]) {
      v.push_back(l);
      mpp[l] = 1;
    }
    if (!mpp[r + 1]) {
      v.push_back(r + 1);
      mpp[r + 1] = 1;
    }
    mp[l]++;
    mp[r + 1]--;
  }
  sort(v.begin(), v.end());
  long long prev = 0;
  int active = 0;
  for (int i = 0; i < v.size(); i++) {
    ans[active] += v[i] - prev;
    active += mp[v[i]];
    prev = v[i];
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
