#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<ll> a(n), b(n);
  rep(i, n) cin >> a[i] >> b[i];
  vector<ll> nex(n + 10, -1);
  ll preb = -1;
  rep(i, n) {
    bool x = false;
    if (a[i] == 1) {
      nex[i + 1] = i;
      x = true;
    }
    if (b[i] == 2) {
      preb = i;
      x = true;
    }
    if (b[i] == 1) {
      nex[i] = preb;
      preb = -1;
    }
    if (x) {
      continue;
    }
    ll now = i;
    for (;;) {
      cout << now + 1 << '\n';
      if (nex[now] >= 0) {
        now = nex[now];
      } else {
        break;
      }
    }
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}