#include <bits/stdc++.h>
using namespace std;
pair<long long, char> cut[400000 + 1];
long long points[2 * 100000 + 1];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < 2 * n; i += 2) {
    cin >> cut[i].first;
    --cut[i].first;
    cut[i].second = 'l';
    cin >> cut[i + 1].first;
    cut[i + 1].second = 'r';
  }
  sort(cut, cut + 2 * n);
  int counter = 1;
  for (int i = 1; i < 2 * n; i++) {
    points[counter] += cut[i].first - cut[i - 1].first;
    if (cut[i].second == 'l') {
      counter++;
    } else {
      counter--;
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << points[i] << " ";
  }
}
