#include <bits/stdc++.h>

using namespace std;

#define MOD 65535
#define buffSize 65536

vector<int> v[65536];

void Delete(int N)
{
    int h = N & MOD;

    for(int i = 0; i != v[h].size(); ++i)
    {
        if(v[h][i] == N)
        {
            v[h][i] = v[h][v[h].size() - 1];

            v[h].pop_back();

            return;
        }
    }
}

bool Find(int N)
{
    int h = N & MOD;

    for(int i = 0; i != v[h].size(); ++i)
    {
        if(v[h][i] == N)
        {
            return true;
        }
    }

    return false;
}

void Insert(int N)
{
    int h = N & MOD;

    v[h].push_back(N);
}

char buffer[buffSize];

int i = buffSize - 1;

inline int get_nr()
{
    int x = 0;

    while(buffer[i] < 48 | buffer[i] > 57)

        if(++i == buffSize) fread(buffer, 1, buffSize, stdin), i = 0;

    while(buffer[i] > 47 & buffer[i] < 58)
    {
        x = x * 10 + buffer[i] - 48;

        if(++i == buffSize) fread(buffer, 1, buffSize, stdin), i = 0;
    }

    return x;
}

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

    int T, Q, x, i = -1;

    char answer[2000000];

    T = get_nr();

    while(T--)
    {
        Q = get_nr();

        x = get_nr();

        if(Q == 1) Insert(x);

        if(Q == 2) Delete(x);

        if(Q == 3)
        {
            answer[++i] = 48 + Find(x);

            answer[++i] = 10;
        }
    }

    answer[++i] = 0;

    puts(answer);

    return 0;
}