#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
const int vas = 1000000;
set<int> s[vas];
int main()
{
    int a, b, n;
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> a >> b;
        if(a == 1)
            s[b % vas].insert(b);
        if(a == 2)
            s[b % vas].erase(b);
        if(a == 3){
            int v = s[b % vas].size();
            s[b % vas].insert(b);
            if(v == s[b % vas].size())
                cout << "1\n";
            else{
                cout << "0\n";
                s[b % vas].erase(b);
            }
        }
    }
    return 0;
}