#include <bits/stdc++.h>
using namespace std;
map<long long, int> vis;
vector<pair<long long, int> > V;
long long fr[200010];
int main() {
  long long n, l, r;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> l;
    cin >> r;
    r++;
    if (vis[l] != 0) {
      V[vis[l]].second++;
    } else {
      V.push_back(make_pair(l, 1));
      vis[l] = V.size() - 1;
    }
    if (vis[r] != 0) {
      V[vis[r]].second--;
    } else {
      V.push_back(make_pair(r, -1));
      vis[r] = V.size() - 1;
    }
  }
  sort(V.begin(), V.end());
  long long sum = V[0].second;
  for (int i = 1; i < V.size(); i++) {
    fr[sum] += (V[i].first - V[i - 1].first);
    sum += V[i].second;
  }
  for (int i = 1; i <= n; i++) {
    cout << fr[i] << " ";
  }
  return 0;
}
