class SegTree:
    def __init__(self,func,unit,array):
        if type(array)==int:n=array;array=[unit]*n
        else:n=len(array)
        self.func=func
        self.unit=unit
        self.num=1<<(n-1).bit_length()
        self.tree=[unit]*2*self.num
        for i in range(n):
            self.tree[self.num+i]=array[i]
        for i in range(self.num-1,0,-1):
            self.tree[i]=self.func(self.tree[2*i],self.tree[2*i+1])
    def get(self,i):return self.tree[i+self.num]
    def set(self,i,x):
        i+=self.num
        self.tree[i]=x
        while i>1:
            self.tree[i>>1]=self.func(self.tree[i],self.tree[i^1])
            i>>=1
    def prod(self,l,r):
        a=self.unit
        l+=self.num
        r+=self.num
        while l<r:
            if l&1:
                a=self.func(a,self.tree[l])
                l+=1
            if r&1:
                a=self.func(a,self.tree[r-1])
            l>>=1
            r>>=1
        return a
s=SegTree(max,p:=0,q:=int(input()))
for i in range(q):
    q,x=map(int,input().split())
    if q==1:s.set(p,x);p+=1
    else:print(s.prod(p-x,p))