#include <bits/stdc++.h>

#define NMax 1000002
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");

int n,p,x;
vector<int> l[NMax];

int occup(int nr,int x){
    for(int i = 0; i < l[nr].size(); ++i)
        if(l[nr][i] == x)
            return i + 1;
    return 0;
}
int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i){
        f >> p >> x;
        if(p == 1){
            if(!occup(n % x, x)){
                l[n % x].push_back(x);
            }
        }
        if(p == 2){
            int ans = occup(n % x,x);
            if(ans){
                l[n % x].erase(l[n % x].begin() + ans - 1);
            }
        }
        if(p == 3){
            if(occup(n % x, x))
                g << 1 << '\n';
            else
                g << 0 << '\n';
        }
    }
    return 0;
}