#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;

struct segtree{
  int N, iden;
  vector<int> tree;
  
  int pow2(int n){
    int ans=1;
    while(ans<n) ans*=2;
    return ans;
  }

  void build(vector<int> &a, int n){
    N=pow2(n);
    iden=-1;
    tree.resize(2*N, iden);
    for(int i=0; i<n; i++) tree[N+i]=a[i];
    for(int i=N-1; i>=1; i--) tree[i]=max(tree[2*i], tree[2*i+1]);
  }

  void update(int node, int x){  //0-indexed
    int i=node+N;
    tree[i]=max(tree[i], x); i/=2;
    while(i>0){
      tree[i]=max(tree[2*i], tree[2*i+1]); i/=2;
    }
    return;
  }

  int query(int s, int t){  //0-indexed
    int left=s+N, right=t+N;
    int ans=iden;
    while(left<=right){
      if(left%2==1){
        ans=max(ans, tree[left]); left++;
      }
      if(right%2==0){
        ans=max(ans, tree[right]); right--;
      }
      left/=2, right/=2;
    }
    return ans;
  }
};


int main(){
  int q; cin >> q;
  vector<int> a(q, -1);
  segtree seg;
  seg.build(a, q);
  int len=0;
  while(q--){
    int t; cin >> t;
    if(t==1){
      int x; cin >> x;
      seg.update(len, x);
      len++;
    }
    else{
      int k; cin >> k;
      cout << seg.query(len-k, len-1) << '\n';
    }
  }
  return 0;
}