#include<cstdio>
    #include<vector>
    using namespace std;
    #define M 99991
    #define pb push_back
    int N  , x , t;
    vector<int> L[M];
    vector<int>::iterator it;

    bool find(int x,int i)
    {
        for(it = L[i].begin() ; it != L[i].end() ; ++it )
            if(*it==x)return 1;
        return 0;
    }

    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 && !find(x,x%M))L[x%M].pb(x);
            if(t == 2)
                for(it = L[x%M].begin(); it != L[x%M].end() ; ++it)
                    if(*it == x)
                    {
                        L[x%M].erase(it);
                        break;
                    }
            if(t == 3){
                if(find(x,x%M))printf("1\n");
                else printf("0\n");}
        }
        return 0;
    }