#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector<int>v[666103];

int cautare(int nr ){
    int mod = nr % 666013;
    if(find(v[mod].begin() , v[mod].end() , nr) != v[mod].end()) return 1;
    return 0;

}

int main(){

    int n,k,nr;
    fin>>n;
    for(int i = 0 ; i < n ; i++){
        fin>>k>>nr;
        int mod = nr%666103;
        switch(k){
            case 1:
                if(!cautare(nr))
                    v[mod].push_back(nr);
                break;

            case 2:
                if(cautare(nr))
                    v[mod].erase(find(v[mod].begin() , v[mod].end() , nr));

                break;

            case 3:
                if(cautare(nr)) fout<<"1\n";
                else    fout<<"0\n";
                break;
        }
    }

fin.close();
fout.close();
return 0;
}