#include <map>
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int v[100000],NIL,DELETED,m;
 void insert(int x)
 {
     int i=0;
     do
     {
        if(v[i]==0) {v[i]=x;break;}
        else i++;
     } while(i<=m);

 }
 int search(int x)
 {
     int i=1,j;
     do
     {

         if(v[i]==x) return i;
         i++;
     }while(i<=m);
     return 0;
 }
 void del(int x)
 {
    int i=1,j;
     do
     {
         if(v[i]==x) {v[i]=DELETED;break;}
         i++;
     }while(i<=m);

 }

int main() {
int n,x,op;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>op>>x;
        if(op==1)
            {
                if(search(x)==0)
                    {insert(x);m++;}

            }
        else if(op==2)
            {
                if(search(x)!=0)
                    {del(x);}
            }
        else if(op==3)
        { if(search(x)==0)
            cout<<0<<'\n';
          else cout<<1<<'\n';

        }
    }

return 0;
}