#include <bits/stdc++.h>

using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

const int MOD = 666013;

vector < int > Hash[MOD];

inline vector < int > ::iterator Search(int x){
    vector < int > ::iterator it;
    int line = x % MOD;
    for(it = Hash[line].begin(); it != Hash[line].end(); it++){
        if(*it == x){
            return it;
        }
    }
    return Hash[line].end();
}

int main(){
    vector < int > ::iterator ans;
    int n, type, x;
    fin >> n;
    while(n--){
        fin >> type >> x;
        ans = Search(x);
        if(type == 1){
            if(ans == Hash[x % MOD].end()){
                Hash[x % MOD].push_back(x);
            }
        }
        if(type == 2){
            if(ans != Hash[x % MOD].end()){
                Hash[x % MOD].erase(ans);
            }
        }
        if(type == 3){
            if(ans == Hash[x % MOD].end()){
                fout << "0\n";
            } else {
                fout << "1\n";
            }
        }
    }
    return 0;
}