#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");

const int prim = 100003;


bool gaseste(vector <int> h[100003], int x)
{
    int nr = x % prim, i;

    for(i=0;i<h[nr].size();i++)
    {
        if(h[nr][i] == x) return 1;
    }

    return 0;
}

void elimina (vector <int> h[100003], int x)
{
    int nr = x % prim;

    if(gaseste(h, x))
    for(int i=0;i<h[nr].size();i++)
    {
        if(x == h[nr][i]) h[nr][i] = -1;
        break;
    }

}

void adauga (vector <int> h[100003], int x)
{
    int nr = x % prim, i;

    if(!gaseste(h, x))
    h[nr].push_back(x);
}



int main()
{

    vector <int> hasht[100003];

    int i, n, x;

    f>>n;

    for(i=0;i<n;i++)
    {
        int y;
        f>>x>>y;
        if(x==1)
        {
           adauga(hasht, y);
        }
        else if(x==2)
        {

            elimina(hasht, y);
        }
        else if(x==3)
        {
            //cin>>x;
            g<<gaseste(hasht, y)<<endl;
        }
    }

}