#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <bitset>
#include <map>
#include <cstring>
#include <algorithm>

#define NMAX 66601

using namespace std;


FILE* fin, * fout;

int n;
set<int>hashi[NMAX];

int main()
{
    fin = fopen("hashuri.in", "r");
    fout = fopen("hashuri.out", "w");
    fscanf(fin, "%d\n", &n);
    for (int i = 1; i <= n; i++)
    {
        int cerinta,x;
        fscanf(fin, "%d %d", &cerinta,&x);
        if (cerinta == 1)
        {
            int has = x % NMAX;
            hashi[has].insert(x);
        }
        else if (cerinta == 2)
        {
            int has = x % NMAX;
            hashi[has].erase(x);
        }
        else if (cerinta == 3)
        {
            int has = x % NMAX;
            if (hashi[has].find(x) != hashi[has].end()) {
                fprintf(fout, "1\n");
            }
            else {
                fprintf(fout, "0\n");
            }
        }
    }
    return 0;
}