#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
const int m=666013;
set<int>v[m+5];
int h(int key)
{
    return key%m;
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    int n ,op,x;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&op,&x);
        int key=h(x);
        if(op==1)
        {
            v[key].insert(x);
            continue;
        }
        if(op==2)
        {
            set<int>::iterator it;
            key=h(x);
            it=v[key].find(x);
            if(it!=v[key].end())v[key].erase(it);
            continue;
        }
        if(op==3)
        {
            set<int>::iterator it;
            it=v[key].find(x);
            if(it!=v[key].end())printf("1\n");
            else
                printf("0\n");
        }
    }
    return 0;
}