#include<fstream>
#include<set>
#include<algorithm>
#define _B 57199//lame
using namespace std;

int main()
{
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    static set<int> hash_t[_B];
    int nOp; fin>>nOp;
    for (int i=1;i<=nOp;i++)
    {
        int op, val;
        fin>>op>>val;
        switch (op)
        {
            case 1: hash_t[val%_B].insert(val); break;
            case 2: hash_t[val%_B].erase(val); break;
            case 3: fout<<hash_t[val%_B].count(val)<<'\n';
        }
    }
    return 0;
}