#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector<int>v[666103];

int cautare(int nr,int rest){
    ///int mod = nr % 666013;
    for(int i = 0 ; i < v[rest].size() ; i++)
        if(v[rest][i] == nr)
            return i;
    return -1;
}

void inserare(int nr,int rest){
    if(cautare(nr,rest) == -1)
        v[rest].push_back(nr);
}
void stergere(int nr,int rest){
    int poz = cautare(nr,rest);
    if(poz > -1)
        v[rest].erase(v[rest].begin()+poz);
}
int main(){

    int n,k,nr;
    fin>>n;
    for(int i = 0 ; i < n ; i++){
        fin>>k>>nr;
        int mod = nr%666103;
        switch(k){
            case 1:
                inserare(nr,mod);
                break;

            case 2:
                stergere(nr,mod);
                break;

            case 3:
                if(cautare(nr,mod) != -1) cout<<"1\n";
                else cout<<"0\n";
                break;
        }
    }

fin.close();
fout.close();
return 0;
}
///nu merge cautatea sa ma fut in ea