#include<iostream>
#include<vector>
#include<stack>
using namespace std;
using ll = long long;

int main(){
    int N;
    cin >> N;
    vector<bool> lock(N,0);
    vector<int> to(N,-1);
    int two = -1;
    for(int i = 0; i < N; i++){
        int A,B;
        cin >> A >> B;
        if(A == 1){
            lock[i] = 1;
            to[i+1] = i;
        }
        if(B == 1){
            to[i] = two;
        }
        if(B == 2){
            lock[i] = 1;
            two = i;
        }
    }

    stack<int> sta;
    for(int i = 0; i < N; i++){
        if(!lock[i]){
            sta.push(i);
            while(sta.size()){
                int now = sta.top();
                sta.pop();
                cout << now + 1 << endl;
                if(to[now] != -1)sta.push(to[now]);
            }
        }
    }
    return 0;
}