#include <bits/stdc++.h>

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