#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 2e5 + 5;
int n;
vector<pair<long long, long long> > p;
long long ans[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  long long x, y;
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    p.push_back({x, 1LL});
    p.push_back({y + 1, -1LL});
  }
  sort(p.begin(), p.end());
  int prev = 0;
  long long sum = 0;
  long long prevsum = N - 1;
  for (int i = 0; i < p.size(); i++) {
    int j = i;
    while (p[i].first == p[j].first && j < p.size()) {
      sum += p[j].second;
      j++;
    }
    ans[prevsum] += p[i].first - p[i - 1].first;
    prevsum = sum;
    prev = p[i].first;
    i = j - 1;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
