#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

void testcase(){
    i64 N; cin >> N;
    vector<i64> nx(N, -1);
    i64 preb2 = -1;
    rep(i,N){
        i64 a,b; cin >> a >> b;
        if(a == 1){
            nx[i+1] = i;
        }
        if(b == 1){
            nx[i] = preb2;
        }
        if(b == 2){
            preb2 = i;
        }
    }
    vector<i64> hold(N);
    rep(i,N) if(nx[i] >= 0) hold[nx[i]] = 1;
    vector<i64> ans;
    rep(i,N) if(!hold[i]){
        ans.push_back(i);
        while(ans.back() != -1) ans.push_back(nx[ans.back()]);
        ans.pop_back();
    }
    rep(i,ans.size()){
        cout << (ans[i] + 1) << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}