#include <iostream>
#include <fstream>
#include <set>
#include <bitset>
using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int N= (1<<25);
bitset<N+10> b;

int main() {
    int n, x, op;
    set<int> s;
    fin >> n;
    for(int i=0; i<n; ++i)
    {
        fin >> op >> x;
        if (op == 1)
        {
            s.insert(x);
            b[x%N]=1;
        }

        else if (op == 2)
        {   if(b[x%N] != 0)
                s.erase(x);
        }
        else
        {
            if(b[x%N] == 1 && s.find(x)!=s.end())
                fout << 1 << "\n";
            else
                fout << 0 << "\n";
        }


    }


    return 0;
}