#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin ("hashuri.in");
ofstream cout ("hashuri.out");
const int mod=666013;
vector <int> v[mod];
int verif (int val)
{
    int poz=val%mod;
    for(int i=0;i<v[poz].size();++i)
        if(v[poz][i]==val)
            return i;
    return -1;
}
void baga (int val)
{
    v[val%mod].push_back(val);
}
void scoate (int val)
{
    int poz,cat;
    poz=val%mod;
    cat=verif(val);
    if(cat==-1)
        return;
    v[poz].erase(v[poz].begin()+cat);
}
int main()
{
    long long t,s=0,cr,i,a,b,c,mx1=0,mx2=0,cnt=0,pz1,pz2,kk=0,pas=1<<20,j,x,y,cj1,cj2,n,m,k;
    cin>>n;
    for(i=1;i<=n;++i)
    {
        cin>>a>>b;
        if(a==1)baga(b);
        else
        if(a==2)scoate(b);
        else
        if(verif(b)!=-1)
            cout<<1<<'\n';
        else
            cout<<0<<'\n';
    }
}