#include <iostream>
#include <vector>
#include <cmath>
#include <memory>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <bitset>
#include <string>
#include <list>
#include <deque>
#include <stack>
#include <limits>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <random>

// #include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
// #include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
static const ll INF = ll_min / 10;
// using mint = modint1000000007;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

ll op(ll a, ll b)
{
	return max(a, b);
}

ll e()
{
	return ll_min;
}

int main()
{
	ll q;
	cin >> q;
	ll r = 0;
	vector<ll> T(q), X(q);
	vector<ll> A;
	rep(i, q)
	{
		cin >> T[i] >> X[i];
		if (T[i] == 1)
		{
			A.push_back(X[i]);
		}
	}
	segtree<ll, op, e> seg(A);
	rep(i, q)
	{
		if (T[i] == 1)
		{
			r++;
		}
		else
		{
			ll k = X[i];
			ll l = r - k;
			cout << seg.prod(l, r) << endl;
		}
	}
	return 0;
}