#include <stdio.h>
#include <vector>
using namespace std;
const int mod=666013;
int i,n,x,t,res,ok;
vector<int> G[mod];
struct nod{int x; nod *next;};
vector<int>::iterator find(int x)
{
    vector<int>::iterator it;
    for(it=G[res].begin();it!=G[res].end();it++)
        if (*it==x) return it;
    return G[res].end();
}
void insert(int x)
{
    vector<int>::iterator it;
    it=find(x);
    if (it==G[res].end()) G[res].push_back(x);
}
void erase(int x)
{
    vector<int>::iterator it;
    it=find(x);
    if (it!=G[res].end()) G[res].erase(it);
}

int main(void)
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%d%d",&t,&x);
        res=x%mod;
        if (t==1)
        {
           insert(x);
           continue;
        }
        if (t==2)
        {
           erase(x);
           continue;
        }
        printf("%d\n",(find(x)!=G[res].end()));
    }
    return 0;
}