#include <bits/stdc++.h>

using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector<int> Hash[2000002];

int main()
{
    int n,p,i,val,key,j,flag1;
    fin>>n;
    for(i = 1; i <= n; ++i){
        fin>>p>>val;
        if(p == 1){
            flag1 = 0;
            key = val/1000;
            for(auto j: Hash[key]){
                if(j == val){
                    flag1 = 1;
                    break;
                }
            }
            if(!flag1){
                Hash[key].push_back(val);
            }
        }else if(p == 2){
            key = val/1000;
            for(j = 0; j < Hash[key].size(); j++){
                if(Hash[key][j] == val){
                    swap(Hash[key][j],Hash[key][Hash[key].size() - 1]);
                    Hash[key].pop_back();
                    break;
                }
            }
        }else if(p == 3){
            flag1 = 0;
            key = val/1000;
            for(auto j: Hash[key]){
                if(j == val){
                    flag1 = 1;
                    break;
                }
            }
            fout<<flag1<<'\n';
        }
    }
    return 0;
}