#include <bits/stdc++.h>

using namespace std;

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

const int MOD = 100003;
int n;
vector<int> Hash[MOD];

bool check(int val) {
    int mod = val % MOD;

    for (int i : Hash[mod])
        if (i == val)
            return true;

    return false;
}

void add(int val) {
    if (!check(val))
        Hash[val % MOD].push_back(val);
}

void del(int val) {
    int mod = val % MOD;

    for (int i = 0; i < Hash[mod].size(); ++i)
        if (Hash[mod][i] == val) {
            Hash[mod][i] = -1;
            return;
        }
}

int main() {
    f >> n;

    int op, val;

    for (int i = 1; i <= n; ++i) {
        f >> op >> val;

        if (op == 1) add(val);
        else if (op == 2) del(val);
        else
            g << check(val) << '\n';
    }

    f.close();
    g.close();
    return 0;
}