#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

int n,Q,x;

unordered_map<int,bool> m;
unordered_set<int> S;

int main()
{
    f>>n;
    while(n--)
        {
            f>>Q>>x;

            /*if (Q == 1)
                m[x] = 1;
            else if (Q == 2)
                m.erase(x);
            else g<<(m[x]?1:0)<<'\n';*/


            if (Q == 1)
                S.insert(x);
            else if (Q == 2)
                S.erase(x);
            else g<<(S.find(x)!=S.end()?1:0)<<'\n';

        }
    return 0;
}