#include <bits/stdc++.h>
using namespace std;
long long ss[2000005];
long long o[2000005];
long long su[2000005];
map<long long, long long> qq;
int main() {
  long long n;
  vector<long long> q;
  cin >> n;
  long long l, r;
  for (int i = 0; i < n; i++) {
    cin >> l >> r;
    qq[l]++;
    qq[r + 1]--;
    q.push_back(l);
    q.push_back(r + 1);
  }
  sort(q.begin(), q.end());
  q.erase(unique(q.begin(), q.end()), q.end());
  long long t = qq[q[0]];
  long long sum = 0;
  for (int i = 0; i < q.size(); i++) {
    ss[i] = qq[q[i]];
    sum += ss[i];
  }
  o[0] = ss[0];
  cout << endl;
  for (int i = 1; i < q.size(); i++) {
    o[i] = o[i - 1] + ss[i];
  }
  for (int i = 1; i < q.size(); i++) {
    long long x = q[i] - q[i - 1];
    su[o[i - 1]] += x;
  }
  for (int i = 1; i <= n; i++) {
    cout << su[i] << " ";
  }
  cout << endl;
}
