#include <bits/stdc++.h>
using namespace std;
const long long maxN = 1e6 + 5;
const long long inf = 1e10;
const long long mod = 1e9 + 7;
struct data {
  long long kt;
  long long mo;
  long long dong;
};
long long n, dem, res[maxN];
map<long long, data> f;
long long a[maxN];
long long l, r;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> l >> r;
    if (f[l].kt == 0) {
      f[l].kt = 1;
      dem++;
      a[dem] = l;
    }
    if (f[r].kt == 0) {
      f[r].kt = 1;
      dem++;
      a[dem] = r;
    }
    f[l].mo++;
    f[r].dong++;
  }
  sort(a + 1, a + 1 + dem);
  long long tmp = 0;
  for (long long i = 1; i <= dem; i++) {
    tmp += f[a[i]].mo;
    res[tmp]++;
    tmp -= f[a[i]].dong;
    if (tmp > 0) res[tmp] += a[i + 1] - (a[i] + 1);
  }
  for (long long i = 1; i <= n; i++) cout << res[i] << " ";
  return 0;
}
