#include <iostream>
#include <fstream>
#include <unordered_set>

using namespace std;

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

int /*a[1000005],*/n,i,tip,x,k,j,ok;
//bool a[2000000003];
unordered_set<int> S;

int main() {

    in>>n;

    for(i=1;i<=n;i++){
        ok=0;
        in>>tip>>x;

        if(tip==1)
            S.insert(x);

        if(tip==2)
            S.erase(x);

        if(tip==3)
            out << !(S.find(x) == S.end()) << '\n';

    }

    return 0;
}