#include <iostream>
#include <fstream>
#include <unordered_set>

using namespace std;

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

int main()
{
    unordered_set <int> Uset;
    int n;
    f >> n;
    for (int i = 1; i <= n; i++)
    {
        int option, x;
        f >> option >> x;
        switch (option)
        {
            case 1:
                Uset.insert(x);
                break;
            case 2:
                Uset.erase(x);
                break;
            case 3:
                if (Uset.find(x) == Uset.end())
                {
                    g << "0\n";
                }
                else
                {
                    g << "1\n";
                }
                break;
        }
    }
}