#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

vector <int> hashul[9973];

int main()
{int n, i, k, j, x, op, t, gst, poz,z;
k = 666013;
f>>n;
for(i = 1; i <= n; i++){
    f>>op>>x;
    gst = 0;
    t = x % k;
    for(j = 0; j < hashul[t].size(); j++){
            if(hashul[t][j] == x){
                gst = 1;
                poz = j;
                break;
            }
    }
    if(op == 1){
        if(gst == 0)
            hashul[t].push_back(x);
    }else{
    if(op == 2){
        if(gst == 1){
            z = hashul[t][j];
            hashul[t][j] = hashul[t].back();
            hashul[t].back() = z;
            hashul[t].pop_back();
        }
    }else{
        if(gst == 1)
            g<<1<<'\n';
        else
            g<<0<<'\n';

}}
}
    return 0;
}