#include<iostream>
#include<vector>
#include<fstream>
#define prim 104729
using namespace std;
vector <long> H[prim];
int cauta (long x)
{
    for(int i=0;i<H[x%prim].size();i++)
        if (x==H[x%prim][i]) return 1;
    return 0;
}
void insereaza (long x)
{
    if(!cauta(x)) H[x%prim].push_back(x);
}
void sterge (long x)
{
    for(int i=0;i<H[x%prim].size();i++)
        if (x==H[x%prim][i]) {H[x%prim][i]=H[x%prim].back();
                                H[x%prim].pop_back();
                                return;
        }
}
int main()
{
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");
    int n,o; long x;
    f>>n;
    for(int i=0;i<n;i++)
    {
        f>>o>>x;
        if(o==1) insereaza(x);
        else if(o==2) sterge(x);
                else g<<cauta(x)<<"\n";
    }
}