#include <bits/stdc++.h>

using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int mod=666013;
vector < int > h[mod];
int n,op,x;
int main()
{
    for(in>>n;n;n--)
    {
        in>>op>>x;
        int k=x%mod;
        switch (op)
        {
            case 1:
            h[k].push_back(x);
            break;
            case 2:
            if(find(h[k].begin(),h[k].end(),x)!=h[k].end())
                h[k].erase(find(h[k].begin(),h[k].end(),x));
            break;
            case 3:
            out<<(find(h[k].begin(),h[k].end(),x)!=h[k].end())<<'\n';
        }
    }
    return 0;
}