#include <cstdio>
#include <vector>

#define MOD 666013

using namespace std;

vector<int> H[MOD];

inline int h(int x) { return x % MOD; }

void add(int x) {
    int b = h(x);
    for (size_t i = 0; i < H[b].size(); i++) {
        if (H[b][i] == x)
            return;
    }

    H[b].push_back(x);
}

void del(int x) {
    int b = h(x);
    for (size_t i = 0; i < H[b].size(); i++) {
        if (H[b][i] == x) {
            swap(H[b][i], H[b][H[b].size()]);
            H[b].pop_back();
            return;
        }
    }
}

int find(int x) {
    int b = h(x);
    for (size_t i = 0; i < H[b].size(); i++) {
        if (H[b][i] == x) {
            return 1;
        }
    }
    return 0;
}

int main() {
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);

    int n, x, type;

    scanf("%d", &n);

    for (int i = 1; i <= n; i++) {
        scanf("%d %d", &type, &x);
        switch (type) {
        case 1:
            add(x);
            break;
        case 2:
            del(x);
            break;
        case 3:
            printf("%d\n", find(x));
            break;
        }
    }

    return 0;
}