/*
*/

#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define PER(i, n) for(ll i=(ll)(n)-1; i>=0; i--)

template<typename T> int LB(const vector<T>& v, T x) { return lower_bound(ALL(v),x)-v.begin(); }
template<typename T> int UQ(T& v) { sort(ALL(v)); v.erase(unique(ALL(v)),v.end()); return v.size(); }
template<typename T> bool chmax(T &a, T b) { return a<b ? a=b, true : false; }
template<typename T> bool chmin(T &a, T b) { return a>b ? a=b, true : false; }
template<typename T> using rpriority_queue = priority_queue<T,vector<T>,greater<T>>;
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using ld=long double; using lll=__int128_t; using ull=unsigned long long;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;


#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif



struct RangeMax {
    int n;
    vector<ll> dat;
    RangeMax(int m) { n=m; dat=vector<ll>(2*n,-INF); }
    void set(int i, ll x) {
        dat[i+=n]=x;
        while(i>>=1) dat[i]=max(dat[i<<1],dat[i<<1|1]);
    }
    ll get(int l, int r) {
        l+=n; r+=n;
        ll ret=-INF;
        while(l<r) {
            if(l&1) chmax(ret,dat[l++]);
            if(r&1) chmax(ret,dat[--r]);
            l>>=1; r>>=1;
        }
        return ret;
    }
};

//----------------------------------------------------------

void solve() {
    ll Q; cin>>Q;
    RangeMax rm(Q);

    ll sz=0;
    REP(i,Q) {
        ll t; cin>>t;

        if(t==1) {
            ll x; cin>>x;
            rm.set(sz,x);
            sz++;
        } else {
            ll k; cin>>k;
            cout<<rm.get(sz-k,sz)<<'\n';
        }
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1;
    //cin>>T;
    while(T--) solve();
}