#include <bits/stdc++.h>
const long double PI = 3.141592653589793238L;
const long long N = 200002;
using namespace std;
long long ans[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v;
  for (int i = 0; i < n; ++i) {
    long long l, r;
    cin >> l >> r;
    v.push_back(make_pair(l, 1));
    v.push_back(make_pair(r + 1, -1));
  }
  v.push_back(make_pair(-1, -1));
  sort(v.begin(), v.end());
  long long curr = 0;
  for (int i = 1; i < v.size(); ++i) {
    ans[curr] += v[i].first - v[i - 1].first;
    curr += v[i].second;
  }
  for (int i = 1; i <= n; ++i) {
    cout << ans[i];
    if (i == n)
      cout << '\n';
    else
      cout << ' ';
  }
  return 0;
}
