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

const int maxl=5e6+10;

int n,m,k,cnt,tot,cas,ans;
int a[maxl],b[maxl];
char s[maxl];

inline void add(int i,int x)
{
    while(i<=n)
        b[i]+=x,i+=i&-i;
}

inline int sum(int i)
{
    int ret=0;
    while(i)
        ret+=b[i],i-=i&-i;
    return ret;
}

inline int findk()
{
    int cnt=0,ans=0;
    for(register int i=22;i>=0;--i)
    if(ans+(1<<i)<=n && cnt+b[ans+(1<<i)]==ans+(1<<i))
        ans+=1<<i,cnt+=b[ans];
    return ans+1;
}

inline void prework()
{
    scanf("%d",&n);
    for(register int i=1;i<=n;++i)
    {
        int op,x;
        scanf("%d%d",&op,&x);
        if(op==1)
        {
            if(!a[x]) a[x]=1,add(x,1);
        }
        else
        {
            if(!a[x])
            {
                add(x,1);
                ans=findk();
                add(x,-1);
            }
            else
                ans=findk();
            printf("%d\n",ans);
        }
    }
}

inline void mainwork()
{
    
}

inline void print()
{
    
}

int main()
{
    int t=1;
    //scanf("%d",&t);
    for(cas=1;cas<=t;cas++)
    {
        prework();
        mainwork();
        print();
    }
    return 0;
}