#include <fstream>
#include <vector>
#define PRIME 1001
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector <int> a[1001];

int cautare(int number)
{
    int key = number % PRIME;
    /// sunt pe linia key din matrice, trebuie sa parcurg intreaga linie !!!
    for (int j = 0; j < a[key].size(); j++) {
        if (a[key][j] == number) {
            return 1;
        }
    }
    return 0;
}

int inserare(int number)
{
    if (cautare(number) == 0) {
        int key = number % PRIME;
        a[key].push_back(number);
    }
}

int stergere(int number)
{
    int key = number % PRIME;
    for (int j = 0; j < a[key].size(); j++)
    if (a[key][j] == number) {
        a[key][j] = a[key][a[key].size() - 1];
        a[key].pop_back();
    }
}


int main () {
    int n, cod, number;
    fin >> n;
    for (int i = 0; i < n; i++) {
        fin >> cod >> number;
        if (cod == 1) {
            inserare(number);
        } else if (cod == 2) {
            stergere(number);
        } else if (cod == 3) {
            fout << cautare(number) << "\n";
        }
    }
    return 0;
}