#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
typedef long long LL;
const int N=50000005;
int fa[N];
int find_fa (int x)    {return fa[x]==x?x:fa[x]=find_fa(fa[x]);}
bool in[N];
int n;
int main()
{
    memset(in,false,sizeof(in));
    scanf("%d",&n);
    for (int u=1;u<=n+1;u++) fa[u]=u;
    for (int u=1;u<=n;u++)
    {
        int op,x;
        scanf("%d%d",&op,&x);
        if (op==1)
        {
            if (in[x]==false)    {in[x]=true;fa[x]=x+1;}
        }
        else
        {
            int t=find_fa(1)-1;
        //    printf("t:%d\n",t);
            if (x!=t+1) printf("%d\n",t+1);
            else  printf("%d\n",find_fa(x+1));
        }
    }
    return 0;
}