#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,i,tip,x;
unordered_map<int,int> m;
int main() {
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>tip>>x;
        if (tip==1)
            m[x]=1;
        else if (tip==2)
            m.erase(x);
        else if (tip==3) {
            if (m.find(x)==m.end())
                fout<<"0\n";
            else
                fout<<"1\n";
        }
    }
    return 0;
}