#include <fstream>
#include <unordered_map>
using namespace std;

const int modulo = 666013;

unordered_map<int, int> cnt[modulo+10];
ifstream f("hashuri.in");
ofstream g("hashuri.out");

int main(){
    int n;
    f >> n;
    for(int i = 0 ; i< n; ++ i){
        int cd, x;
        f >> cd >> x;
        int y = x % modulo;
        if(cd == 1){
            cnt[y][x]++;
        }
        if(cd == 2){
            if(cnt[y].count(x) == 0) continue;
            else cnt[y].erase(x);
        }
        if(cd == 3){
            if(cnt[y].count(x) == 0) g << 0;
            else g << 1;
            g << '\n';
        }
    }
    return 0;
}