#include <fstream>
#include<unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int main()
{
    unordered_map <long long,int> v;
    long long n,x,y;
    f>>n;
    for(long long i=1;i<=n;i++)
    {
        f>>x>>y;
        if(x==1)
            v.insert(make_pair(y,1));
        else
            if(x==2)
                if(v.find(y)!=v.end())
                    v.erase(y);
                    else;
            else
                if(v.find(y)!=v.end())
                    g<<"1\n";
                else
                    g<<"0\n";

    }
    return 0;
}