#include<bits/stdc++.h>
using namespace std;

using ll =long long;

void solve(){
    ll Q;
    cin>>Q;
    vector<ll> B;
    ll cnt=0;
    ll bs=1e10;
    for(int i=0;i<Q;i++){
        ll t,x;
        cin>>t>>x;
        if(t==1){
            while(B.size()>0&&B.back()%bs<=x)B.pop_back();
            B.emplace_back(cnt*bs+x);
            cnt++;
        }
        else{
            ll P=(cnt-x)*bs;
            auto p=lower_bound(B.begin(),B.end(),P);
            cout<<(*p)%bs<<"\n";
        }
    }    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T=1;
    // cin>>T;
    while(T--)solve();
}