#include<bits/stdc++.h>
using namespace std;
ifstream A("hashuri.in");
ofstream B("hashuri.out");
#define M 666013
int n,o,x;
set<int> G[M];
int main()
{
    for(A>>n;n;--n) {
        A>>o>>x;
        if(o==1)
            G[x%M].insert(x);
        else if(o==2)
            G[x%M].erase(x);
        else
            B<<(G[x%M].find(x)!=G[x%M].end())<<'\n';
    }
    return 0;
}