#include <fstream>
#include <vector>

using namespace std;

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

constexpr int MOD = 666013;

int N;

vector <int> G[MOD];

int main()
{
    f >> N;

    for (int i = 1; i <= N; ++ i ) {
        int tip, x;
        f >> tip >> x;

        if (tip == 1) {
            int rest = x % MOD;
            bool ok = 0;
            for (int j = 0; j < G[rest].size(); ++ j ) {
                if (G[ rest ][ j ] == x) ok = 1;
            }
            if (ok == 0) G[ rest ].push_back( x );
        }
        else if (tip == 2) {
            int rest = x % MOD;
            bool ok = 0;
            for (int j = 0; j < G[ rest ].size(); ++ j ) {
                if (G[ rest ][ j ] == x) {
                    G[ rest ][ j ] = 0;
                    break;
                }
            }
        }
        else {
            int rest = x % MOD;
            int val = 0;
            for (int j = 0; j < G[ rest ].size(); ++ j ) {
                if (G[ rest ][ j ] == x) {
                    val = 1;
                    break;
                }
            }
            g << val << '\n';
        }
    }
    return 0;
}