#include<fstream>
#include<vector>
#include<algorithm>
#define _B 379199 //lame
using namespace std;

int main()
{
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    static vector<int> hash_t[_B];
    int nOp; fin>>nOp;
    for (int i=1;i<=nOp;i++)
    {
        int op, val;
        fin>>op>>val;
        vector<int>::iterator it;
        switch (op)
        {
            case 1: hash_t[val%_B].push_back(val); break;
            case 2:
                it=find(hash_t[val%_B].begin(),hash_t[val%_B].end(),val);
                if (it!=hash_t[val%_B].end()) hash_t[val%_B].erase(it); break;
            case 3:
                if (find(hash_t[val%_B].begin(),hash_t[val%_B].end(),val)==hash_t[val%_B].end()) fout<<"0\n";
                else fout<<"1\n";
        }
    }
    return 0;
}