#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

int a[N], b[N], din[N];
vector<int> v[200086];
int main() {
    cin >> n;
    set<int> st, st2;
    for (int i = 1; i < n + 1; i++) {
        scanf("%d%d", a + i, b + i), st.insert(i);
        if (b[i] == 1) st2.insert(i);
    }

    int now = 0;
    for (int i = 1; i < n + 1; i++) {
        if (a[i] == 1 && i != n) din[i]++;
        if (b[i] == 2 && st2.lower_bound(i) != st2.end()) din[i]++, v[*st2.lower_bound(i)].push_back(i);
        if (din[i]) st.erase(i);
    }
    
    while (st.size()) {
        now = *st.begin();
        st.erase(st.begin());
        if (now > 1 && a[now - 1] == 1) {
            if (--din[now - 1] == 0) st.insert(now - 1);
        }
        if (b[now] == 1) {
            st2.erase(now);
            for (auto u : v[now]) {
                if (--din[u] == 0) st.insert(u);
            }
        }
        printf("%d\n", now);
    }
    return 0;
}