#include<cstdio>
#include<bitset>
#include<set>
#include<algorithm>
using namespace std;
int c,n,a;
int main()
{

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