#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
void adaug(unordered_map <int, int> &hash, int nr){
    if(hash.count(b) == 0)
        hash[nr] = 1;
}

int caut(unordered_map <int, int> hash, int nr){
    if(hash.count(nr) == 1)
        return 1;
    return 0;
}

void sterg(unordered_map <int, int> &hash, int nr){
    if(hash.count(nr) == 1)
        hash.erase(nr);
}
int main()
{
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    int nr, a, b;
    unordered_map<int, int> hash;
    fin>>nr;
    for(int i = 0; i < nr; i++){
        fin>>a>>b;

        switch(a){
            case 1: adaug(hash, b);
            break;

            case 2: sterg(hash, b);
            break;

            case 3: fout<<caut(hash, b)<<"\n";
            break;
        }
    }

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