#include <iostream>
#include<fstream>
#include<vector>
#define mod 168457

using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

vector<int>V[mod];
 
int search(int n)
{
    int i = n % mod;
    vector<int>::iterator it;
    for(it = V[i].begin(); it != V[i].end(); ++ it)
    {
        if(*it == n)
            return 1;
    }
    return 0;
}
 
int add(int n)
{
    int i = n % max;
    if(!search(n))
        V[i].push_back(n);
}
 
void del(int n)
{
    int i = n % max;
    vector<int>::iterator it;
    for(it = V[i].begin(); it != V[i].end(); it ++)
    {
        if(*it == n)
            {
            V[n % max].erase(it);
            break;
            }
    }
 
}
int main()
{
    int n, op, nr;
    f >> n;
    for(int i = 0; i < n; i ++)
    {
        f >> op >> nr;
        switch(op)
        {
            case 1:
                 add(nr);
                break;
            case 2:
                if (search(nr)) del(nr);
                break;
            case 3:
                g << search(nr) << '\n';
        }
    }
    return 0;
}