#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long INF = 1e18;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v(n);
  set<pair<long long, long long> > s;
  set<long long> nums;
  long long maxi = 0;
  for (long long i = 0; i < n; i++) {
    cin >> v[i].first >> v[i].second;
    nums.insert(v[i].first);
    nums.insert(v[i].second + 1);
    maxi = max(maxi, v[i].second);
  }
  sort(v.begin(), v.end());
  long long last = *nums.begin();
  nums.insert(maxi + 1);
  long long index = 0;
  vector<long long> ans(n + 1, 0);
  for (auto it : nums) {
    ans[s.size()] += it - last;
    while (s.size() > 0 && (*s.begin()).first == it) s.erase(s.begin());
    while (index < n && v[index].first == it) {
      s.insert({v[index].second + 1, index});
      index++;
    }
    last = it;
  }
  for (long long i = 1; i <= n; i++) cout << ans[i] << ' ';
  cout << '\n';
  return 0;
}
