#include <bits/stdc++.h>
using namespace std;
const int MAX = 5e5 + 1;
long long t, n, cnt;
long long ans[MAX], X[MAX], Y[MAX], a[MAX], sum[MAX], dis[MAX];
long long IIDD(long long x) {
  long long t = lower_bound(a + 1, a + n + 1, x) - a;
  return t;
}
int main() {
  cin >> t;
  for (int i = 1; i <= t; ++i)
    cin >> X[i] >> Y[i], a[++cnt] = X[i], a[++cnt] = Y[i];
  sort(a + 1, a + cnt + 1);
  n = unique(a + 1, a + cnt + 1) - a - 1;
  for (int i = 1; i <= t; ++i) {
    long long xx = IIDD(X[i]), yy = IIDD(Y[i]);
    ++dis[yy], ++sum[xx], --sum[yy + 1];
  }
  for (int i = 1; i <= n; ++i) sum[i] = sum[i] + sum[i - 1];
  for (int i = 1; i <= n - 1; ++i)
    ++ans[sum[i]], ans[sum[i] - dis[i]] += a[i + 1] - a[i] - 1;
  ++ans[sum[n]];
  for (int i = 1; i <= t; ++i) cout << ans[i] << " ";
  return 0;
}
