#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

#include <atcoder/all>
// template atcoder segtree
using S = ll;
S op(S a, S b) {
	return max(a, b);
}
S e() {
	return -1e18;
}
using segtree = atcoder::segtree<S, op, e>;

void solve() {
	int q;
	cin >> q;
	segtree seg(q);
	int sz = 0;
	rep(i, 0, q) {
		int t, x;
		cin >> t >> x;
		if (t == 1) {
			seg.set(sz, x);
			sz++;
		} else {
			cout << seg.prod(sz - x, sz) << "\n";
		}
	}
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}