#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 300500;
const long long INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const long long MOD = 998244353;
const long long OVER_FLOW = 0xffffffff;
long long c, s, T, n, m, q, M;
vector<pair<long long, long long>> v;
map<long long, long long> res;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    long long l, r;
    cin >> l >> r;
    v.emplace_back(l, 1);
    v.emplace_back(r + 1, -1);
  }
  sort(v.begin(), v.end());
  long long cnt = 1;
  for (long long i = 1; i < v.size(); i++) {
    res[cnt] += v[i].first - v[i - 1].first;
    cnt += v[i].second;
  }
  for (long long i = 1; i <= n; i++) {
    cout << res[i] << ' ';
  }
  cout << endl;
  return 0;
}
