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

const int N=1e6*5+10;
int A[N];

int main()
{
    vector<int> v;
    int n,a,b;
    int curr=0;
    scanf("%d",&n);
    memset(A,0,sizeof(A));
    for(int l=0;l<n;l++){
        scanf("%d%d",&a,&b);
        if(a==1){
            A[b]=1;
            if(curr+1==b){
                curr++;
                for(curr;curr<N;curr++){
                    if(A[curr+1]==1) continue;
                    else break;
                }
            }
        }
        else if(a==2){
            if(b==curr+1){
                for(b;b<N;b++){
                    if(A[b+1]==1) continue;
                    else break;
                }
                
                printf("%d\n",b+1);
//                v.push_back(b+1); 
            }
            else{
                printf("%d\n",curr+1);
//                v.push_back(curr+1); 
            }
        }
    }
//    int len=v.size();
//    if(len>0){
//        printf("%d",v[0]);
//        for(int i=1;i<len;i++) printf("\n%d",v[i]);
//    }
    
    return 0;
}