#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e18 + 9;
const long long MAXN = 1e6 + 7;
const long long MAXN1 = 5e2 + 7;
const long long MOD = 1e9 + 7;
const long long ST = 157;
const long long ST1 = 199;
const long double EPS = 1e-9;
const long long BLOCK = 138;
void solve();
signed main() {
  srand('a' + 'l' + 'e' + 'x' + 'X' + '5' + '1' + '2');
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
void solve() {
  int n;
  cin >> n;
  vector<pair<long long, int>> v;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    v.emplace_back(l, -1);
    v.emplace_back(r, 1);
  }
  sort(v.begin(), v.end());
  vector<long long> ans(n + 1);
  int b = -1;
  for (int i = 1; i < 2 * n; i++) {
    if (v[i].second == -1) {
      if (v[i - 1].second == 1) {
        ans[-b] += v[i].first - v[i - 1].first - 1;
      } else {
        ans[-b] += v[i].first - v[i - 1].first;
      }
    } else {
      if (v[i].first != v[i - 1].first || v[i - 1].second == -1) {
        if (v[i - 1].second == 1)
          ans[-b] += v[i].first - v[i - 1].first;
        else
          ans[-b] += v[i].first - v[i - 1].first + 1;
      }
    }
    b += v[i].second;
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
}
