#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const int INF = 1 << 30;
const long long mod = 1e9 + 7;
const double eps = 1e-8;
int n, cnt;
long long ans[MAXN], las;
struct num {
  long long l, r;
} a[MAXN];
map<long long, int> mp;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &a[i].l, &a[i].r);
  for (int i = 1; i <= n; i++) {
    mp[a[i].l]++, mp[a[i].r + 1]--;
  }
  map<long long, int>::iterator it;
  for (it = mp.begin(); it != mp.end(); it++) {
    if (it == mp.begin()) {
      las = it->first;
      cnt = 0;
    }
    ans[cnt] += it->first - las;
    cnt += it->second;
    las = it->first;
  }
  for (int i = 1; i <= n; i++) printf("%lld%c", ans[i], i == n ? '\n' : ' ');
}
