#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    int n;
    cin >> n;
    vector< vector<int> > st(n + 1);
    vector< vector<int> > fin(n + 1);
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        st[a].push_back(i);
        fin[b].push_back(i);
    }

    ordered_set d;
    for (int k = 1; k <= n; k++) {
        for (auto i: st[k]) d.insert(i);
        if (d.size() < k) {
            cout << -1 << ' ';
        } else {
            cout << *d.find_by_order(k - 1) + 1 << ' ';
        }
        for (auto i: fin[k]) d.erase(i);
    }
}