#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;


vector<int> m[3000];
int n,x,operatie;


int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%i", &n);
    for(int i=0;i<n;i++)
    {
            scanf("%i %i", &operatie,&x);
            switch(operatie)
            {
                            case 1: if( find( m[x%3000].begin() , m[x%3000].end() , x) == m[x%3000].end()) m[x%3000].push_back(x);
                                    break;
                            case 2: if( find( m[x%3000].begin() , m[x%3000].end() , x) != m[x%3000].end())
                                         m[x%3000].erase( find( m[x%3000].begin() , m[x%3000].end() , x) );
                                    break;
                            case 3: if(find(m[x%3000].begin(),m[x%3000].end(),x)==m[x%3000].end()) printf("0\n");
                                    else printf("1\n");
                                    break;
            }
    }
    /*int i;
    scanf("%i", &i);*/
    return 0;
}