#include <cstdio>
#include <vector>

#define MOD 8191

std::vector<int> v[8192];

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;
}

__attribute__((always_inline)) int get_number()
{
    static char inBuffer[0x10000];

    static int p = 0x0; int number = 0x0;

    while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
    {
        ++p == 0x10000 && (fread(inBuffer, 0x1, 0x10000, stdin), p = 0x0);
    }

    for(;;)
    {
        number = number * 0xA + inBuffer[p] - 0x30;

        ++p == 0x10000 && (fread(inBuffer, 0x1, 0x10000, stdin), p = 0x0);

        if(inBuffer[p] < 0x30 || inBuffer[p] > 0x39) break;
    }

    return number;
}

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

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

    char answer[2000000];

    T = get_number() + 1;

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

        x = get_number();

        if(Q == 1) v[x & MOD].push_back(x);

        else if(Q & 1)
        {
            answer[++i] = 48 + Find(x);

            answer[++i] = 10;
        }

        else Delete(x);

    }

    answer[++i] = 0;

    puts(answer);

    return 0;
}