#include <cstdio>
#include <unordered_map>
using namespace std;
unordered_map<int,int> has;
int n,x,a;

int main()
{
    freopen("hashuri.in","r", stdin);
    freopen("hashuri.out","w", stdout);
    scanf("%d", &n);
    for(int i = 0; i < n; ++i)
    {
        scanf("%d %d ", &a,&x);
        if(a==1)
            has.insert(make_pair(x,1));
        if(a==2)
            has.erase(x);
        if(a==3)
            if(has[x])
                printf("1\n");
            else
                printf("0\n");
    }
    return 0;
}