#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ve = vector<vector<int>>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)
#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}
ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}


int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n;cin >> n;
  stack<pii> sc;
  vi res(n);
  int cl = 0;
  vi A(n),B(n);
  rep(i,0,n){
    ll &a = A[i],&b = B[i];cin >> a >> b;
    if(a == 1){
      sc.push({i+1,1});
    }else if(b == 2){
      sc.push({i+1,-1});
    }else if(b == 1){
      res[cl++] = i+1;
      if(sz(sc) && sc.top().second < 0){
        res[cl++] = sc.top().first;sc.pop();
      }
      while(sz(sc) && sc.top().second > 0){
        auto [idx,_] = sc.top();sc.pop();
        res[cl++] = idx;
        if(B[idx-1] == 1){
          res[cl++] = sc.top().first;sc.pop();
        }
      }
    }else{
      res[cl++] = i+1;
      while(sz(sc) && sc.top().second > 0){
        auto [idx,_] = sc.top();sc.pop();
        res[cl++] = idx;
        if(B[idx-1] == 1){
          res[cl++] = sc.top().first;sc.pop();
        }
      }
    }
  }
  rep(i,0,n)cout << res[i] << endl;
  assert(sc.empty());
  // while(sz(sc)){
    // cout << sc.top() << endl;
    // sc.pop();
  // }
  

  return 0;
}