#include <bits/stdc++.h>
#define MOD 9973
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
vector <int> H[MOD + 2];
void Erase(int n)
{
    int k = n % MOD;
    vector <int>:: iterator it;
    for(it = H[k].begin();it != H[k].end(); )
        if(*it == n)
        {
            H[k].erase(it);
            return ;
        }
}
void Insert(int n)
{
    int k = n % MOD;
    vector <int>:: iterator it;
    for(it = H[k].begin();it != H[k].end(); )
        if(*it == n) return ;
    H[k].push_back(n);
}
void Find(int n)
{
    int k = n % MOD;
    vector <int>:: iterator it;
    for(it = H[k].begin();it != H[k].end(); )
        if(*it == n)
        {
            out << 1 << '\n';
            return ;
        }
    out << 0 << '\n';
}
int n, q, x;
int main()
{
    in >> n;
    for(int i = 1;i <= n;i++)
    {
        in >> q >> x;
        if(q == 1) Insert(x);
        if(q == 2) Erase(x);
        if(q == 3) Find(x);
    }
    return 0;
}