#include <fstream>
#include <vector>
#define mod 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n;
vector<int> v[mod];

bool exist(int element) {
    for(int i = 0; i < v[element%mod].size(); i++) {
        if(v[element%mod][i] == element) {
            return true;
        }
    }
    return false;
}

void delete_element(int element) {
    for(int i = 0; i < v[element%mod].size(); i++) {
        if(v[element%mod][i] == element) {
            v[element%mod].erase(v[element%mod].begin()+i);
            return;
        }
    }
}

void insert(int element) {
    if(!exist(element))
        v[element%mod].push_back(element);
}

void read() {
    f >> n;
    int operatie,element;
    for(int i = 0; i < n; i++) {
        f >> operatie >> element;
        if(operatie == 1) {
            insert(element);
        }

        else if(operatie == 2) {
            if(exist(element))
                delete_element(element);
        }
        else {
            g << exist(element) << "\n";
        }
    }
}

int main() {
    read();
}