#include <fstream>
#include <vector>
#include <algorithm>

#define mod 50821
using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector <int> H[mod];
int main()
{
    int op, x, n, k;
     vector<int>::iterator it;

    fin >> n;
    for (int i = 0;i < n; ++i)
    {
        fin >> op >> x;
        k = x % mod;
        if (op == 1)
        {
            if (find(H[k].begin(), H[k].end(), x) == H[k].end()) H[k].push_back(x);
        }
        else if (op == 2)
        {
            it = find(H[k].begin(), H[k].end(), x);
            if (it != H[k].end()) H[k].erase(it);
        }
        if (op == 3) fout << (find(H[k].begin(), H[k].end(), x) != H[k].end()) << '\n';
    }
    return 0;
    return 0;
}