#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int mod = 100003;

int n, op, x;

vector<int> v[mod];

void insert(int x) {
    int r = x % mod;

    for (auto it : v[r])
        if (it == x) return;

    v[r].pb(x);
}

void erase(int x) {
    int r = x % mod;

    for (auto &it : v[r])
        if (it == x) {
            swap(it, v[r].back());
            v[r].pop_back();
            return;
        }
}

bool find(int x) {
    int r = x % mod;

    for (auto it : v[r])
        if (it == x) return 1;

    return 0;
}

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

    scanf("%d", &n);

    for (; n; n--) {
        scanf("%d%d", &op, &x);

        if (op == 1) insert(x);
        else if (op == 2) erase(x);
        else printf("%d\n", find(x));
    }

    return 0;
}