#include <bits/stdc++.h>

using namespace std;

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

const int MOD = 1e6 + 33;
int T, p, x, val;
bool OK;
vector<int> G[MOD];

int main()
{
    in >> T;

    while(T--)
    {
        in >> p >> x;

        val = x % MOD;
        OK = 0;

        if(p == 1)
        {
            for(int i : G[val])
                if(i == x)
                {
                    OK = 1;
                    break;
                }

            if(!OK)
                G[val].push_back(x);
        }
        else if(p == 2)
        {
            for(int i = 0; i < G[val].size(); ++i)
            {
                if(OK)
                    G[val][i - 1] = G[val][i];

                if(G[val][i] == x)
                    OK = 1;
            }
            if(OK)
                G[val].pop_back();
        }
        else
        {
            for(int i : G[val])
                if(i == x)
                    OK = 1;

            out << OK << '\n';
        }
    }
    return 0;
}
// solutie inspirata