#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>next(n, -1);
	vector<int>pre(n, -1);
	int tmp = -1;
	rep(i, n) {
		int a, b; cin >> a >> b;
		if (a == 1) {
			next[i + 1] = i;
			pre[i] = i + 1;
		}
		if (b == 2) {
			tmp = i;
		}
		if (b == 1) {
			next[i] = tmp;
			pre[tmp] = i;
			tmp = -1;
		}
	}
	vector<int>ans;
	rep(i, n) {
		if (pre[i] != -1)continue;
		int now = i;
		while (now != -1) {
			ans.push_back(now);
			now = next[now];
		}
	}
	for (auto e : ans)cout << e + 1 << endl;
	return 0;
}