#include <fstream>
#include <algorithm>
#include <vector>
#define Rest 666013
using namespace std;
int n;
vector <int> Hashuri [Rest];
int main()
{
    ifstream in ("hashuri.in");
    ofstream out ("hashuri.out");
    in>>n;
    while (in>>n)
    {
        switch (n)
        {
            case 1:
                {
                    in>>n;
                    if (find(Hashuri[n%Rest].begin(),Hashuri[n%Rest].end(),n)==Hashuri[n%Rest].end())
                    {
                        Hashuri[n%Rest].push_back(n);
                    }
                break;
		}
            case 2:
                {
                    in>>n;
                    if (find(Hashuri[n%Rest].begin(),Hashuri[n%Rest].end(),n)!=Hashuri[n%Rest].end())
                    {
                        vector<int>::iterator it;
                        it=find(Hashuri[n%Rest].begin(),Hashuri[n%Rest].end(),n);
                        Hashuri[n%Rest].erase(it);
                    }
		 break;
                }
            case 3:
                {
                    in>>n;
                    if (find(Hashuri[n%Rest].begin(),Hashuri[n%Rest].end(),n)!=Hashuri[n%Rest].end())
                    {
                        out<<'1'<<'\n';
                    }
                    else
                    {
                        out<<'0'<<'\n';
                    }
                }
        }
    }
    return 0;
}