#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<pair<ll, bool>> events;
  for (int i = 0; i < n; i++) {
    ll l, r;
    cin >> l >> r;
    events.push_back({l, true});
    events.push_back({r + 1, false});
  }
  sort(events.begin(), events.end());
  vector<ll> ans(n + 1);
  int cnt = 0;
  ll last = 0;
  int n_events = events.size();
  for (int i = 0, j = 0; i < events.size(); i = j) {
    while (j < events.size() and events[j] == events[i]) j++;
    ll current = events[i].first;
    if constexpr (false) cerr << "cnt: " << cnt << endl;
    ans[cnt] += current - last;
    last = current;
    if (events[i].second) {
      cnt += j - i;
    } else {
      cnt -= j - i;
    }
  }
  for (int k = 1; k <= n; k++) {
    cout << ans[k] << ' ';
  }
  cout << endl;
}
