#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];



int main() {
	cin >> m;
	set<pii> st;
	while (m--) {
		int op, a;
		scanf("%d%d", &op, &a);
		if (op == 1) {
			w[++n] = a;
			while (st.size() && st.rbegin()->second <= w[n]) st.erase(*st.rbegin());
			st.insert({n, a});
		} else printf("%d\n", st.lower_bound({n - a + 1, -INF})->second);
	}
	return 0;
}