#include <bits/stdc++.h>

using namespace std;

#define MOD 16383
#define buffSize 2000000

list<int> table[16384];

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

    for(auto it = table[hashCode].begin(); it != table[hashCode].end(); it++)
    {
        if(*it == N)
        {
            table[hashCode].erase(it);

            return;
        }
    }
}

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

    for(auto it = table[hashCode].begin(); it != table[hashCode].end(); it++)
    {
        if(*it == N)
        {
            return true;
        }
    }

    return false;
}

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

    if(!Find(N))
    {
        table[hashCode].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;

    T = get_nr();

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

        x = get_nr();

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

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

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

            buffer[++i] = 10;
        }
    }

    buffer[++i] = 0;

    puts(buffer);

    return 0;
}