#include <iostream>
#include <fstream>
#include <queue>
#include <bitset>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,S,t,T,x,y,z,ok,nr,C;
bitset <2000000003>has;
int main()
{
    in>>n;
    for(i=1;i<=n;i++){
        in>>x>>y;
        if(x==1) {has[y]=1;}
        if(x==2) {has[y]=0;}
        if(x==3) {
        if(has[y]==1) out<<1<<'\n';
        else out<<0<<'\n';
                   }

    }
    return 0;
}