#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long a;
  long long b;
  vector<pair<long long, long long> > v;
  for (long long i = 0; i < n; i++) {
    cin >> a >> b;
    v.push_back(make_pair(a, 0));
    v.push_back(make_pair(b + 1, 1));
  }
  sort(v.begin(), v.end());
  long long d[n + 1];
  memset(d, 0, sizeof(d));
  long long i = 0;
  long long in = 0;
  while (i < 2 * n) {
    if (v[i].second == 0) {
      in++;
      d[in] += v[i + 1].first - v[i].first;
    } else {
      in--;
      if ((i + 1) < 2 * n) d[in] += v[i + 1].first - v[i].first;
    }
    i++;
  }
  for (long long k = 1; k <= n; k++) {
    cout << d[k] << " ";
  }
  return 0;
}
