#include <cstdio>
#include <unordered_set>
#define P 1000003
using namespace std;
int n,c,v,h;
unordered_set<int> T[P];
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d",&n);
    for(;n;n--)
    {
        scanf("%d%d",&c,&v);
        h=v%P;
        if(c==1)
            T[h].insert(v);
        else
            if(c==2)
                T[h].erase(v);
                else
                    T[h].find(v)==T[h].end()? printf("0\n"):printf("1\n");
    }
    return 0;
}