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

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

int tip,n,i,x;
unordered_set<int> s;

int main()
{
    fin>>n;
    for(i=1;i<=n;++i)
    {
        fin>>tip>>x;
         if(tip==1)
        {
            if(s.find(x)==s.end())
                s.insert(x);
            continue;
        }
        if(tip==2)
        {
            if(s.find(x)!=s.end())
                s.erase(x);
            continue;
        }
        if(tip==3)
        {
            if(s.find(x)!=s.end())
                fout<<"1\n";
            else
                fout<<"0\n";
        }

    }
    return 0;
}