while (true) {
        int n; cin >> n;
        vector<int> arr(32000);
        segment_tree t(arr);
        vector<int> levels(n);
        for (int i = 0; i < n; ++i) {
            int x, y; cin >> x >> y;
            t.add(x, 1);
            int level = t.sum(0, x) - 1;
            ++levels[level];
        }

        for (int j = 0; j < levels.size(); ++j) {
            cout << levels[j];
            if (j < levels.size() - 1) {
                cout << '\n';
            }
        }

        if (cin.eof()) {
            break;
        }

        cout << '\n';
    }