#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

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

unordered_set <int> S;

int x,y,n,i;

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

return 0;
}