#include<cstdio>
#include<vector>
#define H 100009
using namespace std;
int n,p,x;
vector<int> hash[H];
void insert()
{
    int r=x%H;
    vector<int>::iterator it;
    for(it=hash[r].begin();it!=hash[r].end();it++)
    {
        if(*it==x) break;
    }
    if(it==hash[r].end()) hash[r].push_back(x);
}
void erase()
{
    int r=x%H;
    vector<int>::iterator it;
    for(it=hash[r].begin();it!=hash[r].end();it++)
    {
        if(*it==x) break;
    }
    if(it!=hash[r].end()) {*it=hash[r].back(); hash[r].pop_back();}
}
void find()
{
    int r=x%H;
    vector<int>::iterator it;
    for(it=hash[r].begin();it!=hash[r].end();it++)
    {
        if(*it==x) break;
    }
    if(it==hash[r].end()) printf("0\n");
    else printf("1\n");
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d",&n);
    for(;n;n--)
    {
        scanf("%d%d",&p,&x);
        switch(p)
        {
            case 1:{insert(); break;}
            case 2:{erase(); break;}
            case 3:{find(); break;}
            break;
        }
    }
    return 0;
}