#include<cstdio>
#include<queue>
#include<unordered_set>
using namespace std;
FILE*in=fopen("hashuri.in","r");
FILE*out=fopen("hashuri.out","w");
const int mod=100153;
unordered_set<int> s[mod];
int n,i,op,a;
int main()
{
    fscanf(in,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(in,"%d%d",&op,&a);
        if(op==1)
        {
            s[a%mod].insert(a);
        }
        else if(op==2)
        {
            s[a%mod].erase(a);
        }
        else
        {
            if(s[a%mod].find(a)!=s[a%mod].end())
            {
                fprintf(out,"1\n");
            }
            else
            {
                fprintf(out,"0\n");
            }
        }
    }
}