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

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

int n, x, k;
vector <int> G[mod];

auto Find(int x){
    int p = x % mod;
    for(auto it = G[p].begin();it!=G[p].end(); it++){
        if(*it == x){
            return it;
        }
    }
    return G[p].end();
}

void Insert(int x){
    int p = x % mod;
    if(Find(x) == G[p].end()){
        G[p].push_back(x);
    }
}

void Erase(int x){
    int p = x % mod;
    auto it = Find(x);
    if(it != G[p].end()){
        G[p].erase(it);
    }
}

int main(){
    fin>>n;
    while(n--){
        fin>>k>>x;
        if(k==1){
            Insert(x);
        }else if(k==2){
            Erase(x);
        }else{
            fout<<(Find(x) != G[x%mod].end())<<'\n';
        }
    }
    return 0;
}