#include <fstream>
#include <unordered_map>
using namespace std;

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

int n;

unordered_map<int,int> umap;

int main()
{
    int i,query,x;
    fin >> n;
    for(i=1;i<=n;++i)
    {
        fin >> query >> x;
        if(query == 1)
            umap[x]++;
        else if(query == 2)
            umap.erase(x);
        else if(query == 3)
        {
            if(umap[x]!=0)
                fout << "1\n";
            else
                fout << "0\n";
        }
    }
    return 0;
}