#include <bits/stdc++.h>

using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int,int>a;
int n,Nr;
int main()
{
    int tip,x;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>tip>>x;
        if(tip==1 && a.find(x)==a.end()) a[x]=++Nr;
        if(tip==2) a.erase(x);
        if(tip==3) fout<<(a.find(x)!=a.end())<<"\n";
    }
    return 0;
}