#include <bits/stdc++.h>
using namespace std;
int read() {
  int xx = 0, ff = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    xx = xx * 10 + ch - '0';
    ch = getchar();
  }
  return xx * ff;
}
long long READ() {
  long long xx = 0, ff = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    xx = xx * 10 + ch - '0';
    ch = getchar();
  }
  return xx * ff;
}
const int maxn = 400010;
struct point {
  long long pos;
  int val;
  bool friend operator<(const point& A, const point& B) {
    return A.pos < B.pos;
  }
} P[maxn];
int N;
long long ans[maxn];
int main() {
  N = read();
  for (int i = 1; i <= N; i++) {
    P[i].pos = READ();
    P[i].val = 1;
    P[i + N].pos = READ() + 1;
    P[i + N].val = -1;
  }
  sort(P + 1, P + 1 + 2 * N);
  int now = 0;
  long long prev = P[1].pos;
  for (int i = 1; i <= 2 * N; i++) {
    ans[now] += P[i].pos - prev;
    now += P[i].val;
    prev = P[i].pos;
  }
  for (int i = 1; i <= N; i++) printf("%I64d ", ans[i]);
  return 0;
}
