#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int nrprim = 999983;
vector <int> v[1000005];
int main()
{
    int n, op, nr;
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> op >> nr;
        if(op == 1){
            bool ok = 1;
            for(auto elem : v[nr % nrprim]){
                if(elem == nr){
                    ok = 0;
                }
            }
            if(ok == 1){
                v[nr % nrprim].push_back(nr);
            }
        }
        else if(op == 2){
            for(int j = 0; j < v[nr % nrprim].size(); j ++){
                if(v[nr % nrprim][j] == nr){
                    v[nr % nrprim].erase(v[nr % nrprim].begin() + j);
                    break;
                }
            }
        }
        else if(op == 3){
            bool ok = 0;
            for(auto &elem : v[nr % nrprim]){
                if(elem == nr){
                    ok = 1;
                    break;
                }
            }
            cout << ok << "\n";
        }
    }
    return 0;
}