using namespace std;
#include<stdio.h>
#include<vector>
#define mod 666013
vector <int> v[mod];
int n;
vector<int>::iterator find(int x)
{
int list=x%mod;
for(unsigned int i=0;i<v[list].size();i++)
if(x==v[list][i])
    return v[list].begin()+i;
return v[list].end();
}
void add(int x)
{int list=x%mod;
    if(find(x)==v[list].end())
        v[list].push_back(x);
}
void dell(int x)
{int list=x%mod;
    vector<int>::iterator it=find(x);
    if(it!=v[list].end())
    v[list].erase(it);
}
void solve()
{
    scanf("%d",&n);
    while(n--)
    {int x,op;
        scanf("%d %d",&op,&x);
        if(op==1)add(x);
        if(op==2)dell(x);
        if(op==3)
            printf("%d \n",find(x)!=v[x%mod].end());
    }
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    solve();
    return 0;
}