#include <bits/stdc++.h>

using namespace std;
ifstream hashin("hashuri.in");
ofstream hashout("hashuri.out");
unordered_set<int> s;
int n,t,x;
int main()
{
    hashin>>n;
    for( ; n; n--)
    {
        hashin>>t>>x;
        if(t==1)
            s.insert(x);
        else if(t==2)
            s.erase(x);
        else if(s.find(x)==s.end())
            hashout<<"0\n";
        else
            hashout<<"1\n";
    }
    return 0;
}