#include <bits/stdc++.h>
int main() {
  int n;
  std::cin >> n;
  std::map<long long, int> line;
  for (int i = 0; i < n; ++i) {
    static long long l, r;
    std::cin >> l >> r;
    auto it = line.find(l);
    if (it == line.end()) {
      line.insert({l, 1});
    } else {
      ++it->second;
    }
    it = line.find(r + 1);
    if (it == line.end()) {
      line.insert({r + 1, -1});
    } else {
      --it->second;
    }
  }
  int count = 0;
  long long prev = 0;
  std::vector<long long> cnt(n, 0);
  for (auto it = line.begin(); it != line.end(); ++it) {
    if (count > 0) {
      cnt[count - 1] += it->first - prev;
    }
    count += it->second;
    prev = it->first;
  }
  for (int i = 0; i < n; ++i) {
    std::cout << cnt[i] << ' ';
  }
  return 0;
}
