#include #define fi first #define se second #define rep(i,s,n) for (int i = (s); i < (n); ++i) #define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define len(x) (int)(x).size() #define dup(x,y) (((x)+(y)-1)/(y)) #define pb push_back #define eb emplace_back #define Field(T) vector> using namespace std; using ll = long long; using ull = unsigned long long; template using pq = priority_queue,greater>; using P = pair; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b struct SegTree { public: SegTree() : SegTree(0) {} SegTree(int n) : SegTree(vector(n, e())) {} SegTree(int n, S v) : SegTree(vector(n, v)) {} SegTree(const vector& v) : _n(int(v.size())){ lg = 0; while ((1U << lg) < (unsigned int)(_n)) lg++; siz = 1 << lg; d = vector(2 * siz, e()); for (int i = 0; i < _n; ++i) d[siz + i] = v[i]; for (int i = siz-1; i >= 1; --i) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += siz; d[p] = x; for (int i = 1; i <= lg; ++i) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); return d[p+siz]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); S sml = e(), smr = e(); l += siz; r += siz; while(l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } using F = function; // max_{r \in [l, n]} f(prod(l, r)) == true int max_right(int l, const F &f) { assert(0 <= l && l <= _n); assert(f(e())); if (l == _n) return _n; l += siz; S v = e(); do { while(l % 2 == 0) l >>= 1; if (!f(op(v, d[l]))) { while(l < siz) { l *= 2; if (f(op(v, d[l]))) { v = op(v, d[l]); ++l; } } return l - siz; } v = op(v, d[l]); ++l; } while((l & -l) != l); return _n; } private: int _n, siz, lg; vector d; void update(int k) {d[k] = op(d[2*k], d[2*k+1]);} }; using S = int; S op(S a, S b) { return max(a, b); } S e() {return 0;} int main() { int q; cin >> q; SegTree seg(q); int idx = 0; while(q--) { int t; cin >> t; if (t == 1) { int x; cin >> x; seg.set(idx, x); ++idx; } else { int k; cin >> k; cout << seg.prod(idx-k, idx) << endl; } } return 0; }