#include <bits/stdc++.h>
std::pair<long long, int> A[400005];
long long res[400005], x, y, N, cur;
int main() {
  scanf("%lld", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%lld %lld", &x, &y);
    A[2 * i] = {x, 1}, A[2 * i + 1] = {y + 1, -1};
  }
  std::sort(A, A + 2 * N);
  for (int i = 0; i < 2 * N - 1; ++i) {
    if (A[i].second == -1) {
      while (A[i].first == A[i + 1].first && A[i + 1].second == -1) i++, cur--;
      res[--cur] += (A[i + 1].first - A[i].first);
      continue;
    }
    while (A[i].first == A[i + 1].first && A[i + 1].second == 1) i++, cur++;
    res[++cur] += (A[i + 1].first - A[i].first);
  }
  for (int i = 1; i <= N; ++i) printf("%lld ", res[i]);
}
