#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int prim = 811777;
vector <int> h[prim];


bool este(int val)
{
    for (int i = 0; i < h[val % prim].size(); i++)
    {
        if(h[val % prim][i] == val)
        {
            return true;
        }
    }
    return false;
}

void adauga(int val)
{
    h[val % prim].push_back(val);
}

void sterge(int val)
{
    for(int i = 0; i < h[val % prim].size(); i++)
    {
        if (h[val % prim][i] == val)
        {
            h[val % prim][i] = h[val % prim][h[val % prim].size() - 1];
            h[val % prim].pop_back();
            return;
        }
    }
}


int main() {
    int n, c, a;
    in >> n;
    for(int i = 1; i <= n; i++)
    {
        in >> c >> a;
        switch(c)
        {
            case 1:
                adauga(a);
                break;
            case 2:
                sterge(a);
                break;
            case 3:
                out << (int)este(a) << '\n';
        }
    }
    return 0;
}