#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
using p = pair<int, int>;
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n; cin >> n;
    vector<p> vp(n);
    vi v1, v2;
    rep(i, n){
        int a, b; cin >> a >> b;
        vp[i] = {a, b};
        if(b == 1){
            v1.push_back(i+1);
        }else if(b == 2){
            v2.push_back(i+1);
        }
    }
    map<int, int> mp;
    rep(i, v2.size()){
        mp[v2[i]] = v1[i];
    }


    stack<p> st;
    queue<int> q;
    rep(i, n){
        auto [a, b] = vp[i];
        if(a != 1 && b != 2){
            q.push(i+1);
        }else if(a == 1){
            st.push({0, i+1});
        }else{
            st.push({1, i+1});
        }
        if(q.empty())continue;
        while(!st.empty()){
            auto [c, d] = st.top();
            if(c == 0){
                if(q.back() == d+1){
                    q.push(d);
                    st.pop();
                }else{
                    break;
                }
            }else{
                if(q.back() == mp[d]){
                    q.push(d);
                    st.pop();
                }else{
                    break;
                }
            }
        }
    }
    while(!q.empty()){
        cout << q.front() << endl;
        q.pop();
    }
    return 0;
}