#include<stdio.h>
const int Nmax=1000000;
int H[Nmax],n;
int find(int x)
{
    int i;
    for(i=0;i<n;i++)
          if(H[i]==x)
                     return i;
    return -1;
}
void insert(int x)
{
     if(find(x)==-1)
                    H[n++]=x;
     
}
void sterge(int x)
{
     int p=find(x);
     if(p==-1)
           return ;
     for(int i=p;i<n-1;i++)
                     H[i]=H[i+1];
     n--;
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%i",&n);
    int i,op,x;
    for(i=0;i<n;i++)
    {
                    scanf("%i%i",&op,&x);
                    if(op==1)
                             insert(x);
                    if(op==2)
                              sterge(x);
                    printf("%i",find(x)!=-1);
    }
    return 0;
}