#include<cstdio>
    #include<set>
    using namespace std;
    #define MAX 1000000
    int N , t , x;
    multiset<int>  Q;

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