#include <bits/stdc++.h>

using namespace std;

ifstream fin("hash.in");
ofstream fout("hash.out");
#define cin fin
#define cout fout

#define N 505
#define mod 666013
long long n, cerinta, x, c, r, ok;
vector < vector < int > > g;

int main()
{
    cin >> n;
    g.resize(mod+5);
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> cerinta >> x;
        c = x/mod;
        r = x%mod;
        if(cerinta == 1)
        {
            ok = 0;
            for(auto t : g[r])
            {
                if(t == c)ok = 1;
            }
            if(ok == 0)g[r].push_back(c);
        }
        else if(cerinta == 2)
        {
            for(int j = 0 ; j < g[r].size() ; j++)
            {
                if(g[r][j] == c)
                {
                    g[r].erase(g[r].begin()+j);
                    break;
                }
            }
        }
        else
        {
            ok = 0;
            for(auto t : g[r])
            {
                if(t == c)
                {
                    ok = 1;
                }
            }
            cout << ok << '\n';
        }
    }
    return 0;
}