#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000;
int cur;
long long ans[MAXN + 5];
map<long long, int> event;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    long long l, r;
    cin >> l >> r;
    event[l]++;
    event[r + 1]--;
  }
  long long pre = 0;
  for (auto p : event) {
    long long pos = p.first, add = p.second;
    if (cur >= 1 && cur <= N) {
      ans[cur] += pos - pre;
    }
    cur += add;
    pre = pos;
  }
  for (int i = 1; i <= N; i++) {
    cout << ans[i] << (i + 1 <= N ? " " : "\n");
  }
}
