#include <bits/stdc++.h>
using namespace std;

#define P 666013

vector<int> B[P];

vector<int>::iterator check(int val){

vector<int>::iterator v;
for(v = B[val%P].begin(); v!=B[val%P].end(); v++)
    if(*v == val)
        return v;
return B[val%P].end();

}

void add(int val){

if(check(val)==B[val%P].end())
    B[val%P].push_back(val);
return;

}

void del(int val){

vector<int>::iterator k=check(val);
if(k!=B[val%P].end())
    B[val%P].erase(k);
return;

}

int main() {

    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    int n;
    fin>>n;
    int op,val;
    while(n){
        fin>>op>>val;
        switch(op){
            case 1: add(val);
                    break;
            case 2: del(val);
                    break;
            case 3: if(check(val) != B[val%P].end())
                        cout<<"1"<<endl;
                    else
                        cout<<"0"<<endl;
                    break;
            default: break;
        }
        --n;
    }

    return 0;
}