#include <bits/stdc++.h>

using namespace std;

map <int,long long> M;
int n;

int main()
{
    int op,x;
    int t=0;
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    fin>>n;
    for(int i=0;i<n;i++){
        fin>>op>>x;
        if(op==1&&M.find(x)==M.end()) M[x]=++t;
        else if(op==2) M.erase(x);
        else if(op==3) if(M.find(x)!=M.end()) fout<<"1\n";
                            else fout<<"0\n";
    }
    fin.close();
    fout.close();
    return 0;
}