#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int mul(long long int a, long long int b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long int add(long long int a, long long int b) {
  return ((a % mod) + (b % mod)) % mod;
}
long long int sub(long long int a, long long int b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
long long int gcdExtended(long long int a, long long int b, long long int *x,
                          long long int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(long long int b) {
  long long int x, y;
  long long int g = gcdExtended(b, mod, &x, &y);
  if (g != 1) return -1;
  return (x % mod + mod) % mod;
}
long long int modDivide(long long int a, long long int b) {
  a = a % mod;
  long long int inv = modInverse(b);
  if (inv == -1)
    return -1;
  else
    return (inv * a) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, t, j, inp, n, a, b;
  cin >> n;
  vector<pair<long long int, long long int>> coor;
  for (j = 0; j < n; j++) {
    cin >> a >> b;
    coor.push_back({a, 1});
    coor.push_back({b + 1, -1});
  }
  sort(coor.begin(), coor.end());
  vector<long long int> count(n + 1, 0);
  long long int segment = 1;
  for (j = 1; j < coor.size(); j++) {
    long long int num = coor[j].first - coor[j - 1].first;
    count[segment] += num;
    segment += coor[j].second;
  }
  for (j = 1; j <= n; j++) {
    cout << count[j] << " ";
  }
  cout << endl;
  return 0;
}
