#include<iostream>
#include<cstdio>
#include<unordered_set>
using namespace std;
int n,x,c;

int main()
{
    hash_set<int> H;
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d",&n);
    for(;n;n--)
    {
        scanf("%d%d",&c,&x);
        if(c==1)H.insert(x);
        else if(c==2)H.erase(x);
        else H.find(x)==H.end()?printf("1\n"):printf("0\n");
    }
    return 0;
}