#include <bits/stdc++.h>
using namespace std;
pair<long long, int> p[400005];
long long n, m = 1;
long long sum[200005];
int main() {
  scanf("%lld", &n);
  long long a, b;
  for (long long i = 1; i <= n; i++) {
    scanf("%lld%lld", &a, &b);
    p[m++] = make_pair(a, 1);
    p[m++] = make_pair(b + 1, -1);
  }
  sort(p + 1, p + 1 + m);
  long long flag = 0;
  for (long long i = 1; i < m; i++) {
    flag += p[i].second;
    sum[flag] += p[i + 1].first - p[i].first;
  }
  for (long long i = 1; i <= n; i++) {
    cout << sum[i] << endl;
  }
}
