#include <cstdio>
#include <cstdlib>
#include <map>
#include <utility>
using namespace std;


map<long,bool> m[1000];
long n,x,operatie;


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