#include<fstream>
#include<unordered_set>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_set<int> a;
int main()
{
    int n;
    for(cin>>n;n--;) {
        int i,j;
        cin>>i>>j;
        auto k=a.find(j);
        if(i==1&&k==a.end())
            a.insert(j);
        else if(i==2&&k!=a.end())
            a.erase(j);
        else if(i==3)
            cout<<(k!=a.end())<<'\n';
    }
    return 0;
}