// Hashuri
#include <fstream>
#include <vector>
#define Key 10007
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N;
vector < int > H[Key+1];

bool Find(int x)
{
    int list= x % Key;
    for(vector<int>::iterator it=H[list].begin(); it!=H[list].end(); ++it)
        if( x == *it ) return 1;
    return 0;
}

void Add(int x)
{
    if ( !Find(x) ) H[x % Key].push_back(x);
}

void Delete(int x)
{
    int list = x % Key;
    for (vector<int>::iterator it=H[list].begin(); it!=H[list].end(); ++it)
        if ( x == *it )
        {
             H[list].erase(it);
             return;
        }
}

int main()
{
    f>>N;
    for (int i=1;i<=N;++i)
    {
        int tip,x;
        f>>tip>>x;
        if (tip==1)Add(x);
        if (tip==2)Delete(x);
        if (tip==3)g<<Find(x)<<'\n';
    }
    f.close();g.close();
    return 0;
}