#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector < int > H[MOD];
int N,operatia,x;
void adauga(int x)
{
    int indice=x%MOD; /// K E Y
    if(find(H[indice].begin(),H[indice].end(),x) == H[indice].end())
         H[indice].push_back(x);

}
void elimina(int x)
{
    bool found=0;
    int indice=x%MOD;
    for(int i = 0 ; i < H[indice].size(); i++)
        if(H[indice][i]==x)
          found=true;
          else if(found)
            H[indice][i-1]=H[indice][i]; ///mutam elementul la capat
          if(found) H[indice].pop_back();

}
bool existenta(int x)
{
    int indice=x%MOD;
    if(find(H[indice].begin(), H[indice].end(),x) == H[indice].end())
         return 0;
    return 1;
}
int main()
{
     fin>>N;
     while(N--)
     {
         fin>>operatia>>x;
         if(operatia==1) adauga(x);
         else if(operatia == 2) elimina(x);
          else fout<< existenta(x)<<'\n';

     }

}