#include<fstream>
#include<set>
#define P 5000
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
long long x,n,i,j,l;

set<int>a[P+10];

int main()
{
    f>>n;

    for(i=1;i<=n;i++)
    {
        f>>j>>l;
        if(j==1) a[l%P].insert(l);
        else if(j==2) a[l%P].erase(l);
        else {
                   if(a[l%P].find(l)!=a[l%P].end()) g<<1<<"\n";
                     else g<<0<<"\n";
        }
    }

    return 0;
}