#include <bits/stdc++.h>
using namespace std;
const int len = 2e5 + 5;
const long long inf = 1e18 + 5;
long long cnt[len];
vector<pair<long long, int> > vec;
int main() {
  int n, cur = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    long long l, r;
    scanf("%lld %lld", &l, &r);
    vec.push_back(make_pair(l, 0));
    vec.push_back(make_pair(r + 1, 1));
  }
  sort(vec.begin(), vec.end());
  vec.push_back(make_pair(inf, 0));
  for (int i = 0; i < 2 * n; i++) {
    int j;
    for (j = i; j < 2 * n && vec[j].first == vec[i].first; j++) {
      if (vec[j].second == 0)
        cur++;
      else
        cur--;
    }
    cnt[cur] += vec[j].first - vec[i].first;
    i = j - 1;
  }
  for (int i = 1; i <= n; i++) printf("%lld ", cnt[i]);
  printf("\n");
  return 0;
}
