#include <bits/stdc++.h>
std::ifstream fin("hashuri.in");
std::ofstream fout("hashuri.out");

int n;
const int M = 666013;
std::vector<int> H[M];

int find(int x)
{
    for(int i = 0; i < H[x % M].size(); i++)
        if(H[x % M][i] == x)
            return i;
    return -1;
}

void insert(int x)
{
    if(find(x) == -1)
        H[x % M].push_back(x);
}

void remove(int x)
{
    if(find(x) != -1)
        H[x % M].erase(H[x % M].begin() + find(x));
}

int main()
{
    fin >> n;
    int x, op;
    for(int i = 0; i < n; i++)
    {
        fin >> op >> x;
        if(op == 1)
            insert(x);
        else if(op == 2)
            remove(x);
        else if(op == 3)
            fout << (find(x)!= -1) << '\n';

    }
    return 0;
}