#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_set<int> s;
int c,val,n;
int main()
{
    in>>n;
    for(int i=1;i<=n;++i)
    {
        in>>c>>val;
        if(c==1)s.insert(val);
        if(c==2)if(s.find(val)!=s.end())s.erase(val);
        if(c==3)
        {
            if(s.find(val)!=s.end())out<<"1";
            else out<<"0";
            out<<'\n';
        }
    }
    return 0;
}