#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
#define PRIM 666013
vector<int> h[PRIM];
ifstream in("hash.in");
ofstream out("hash.out");

int key(int x) {
    return x % PRIM;
}
void add(int wat) {
    h[key(wat)].push_back(wat);
}
void rmv(int wat) {
    int k = key(wat);
    int cnt = -1;
    for (vector<int>::iterator i = h[k].begin(); i != h[k].end(); i++)
        if (*i == wat) {
            h[k].erase(i);
            return;
        }
}

bool fnd(int wat) {
    int k = key(wat);
    for (vector<int>::iterator i = h[k].begin(); i != h[k].end(); i++)
        if (*i == wat)
            return 1;
    return 0;
}
int main() {
    int n;
    in>>n;
    for (int i = 1; i <= n; i++) {
        int nr, wat;
        in>>nr>>wat;
        switch (nr) {
            case 1:
                add(wat);
            break;
            case 2:
                rmv(wat); //Windows 7 genuine activation
            break;
            case 3:
                out<<fnd(wat)<<"\n"; //find wat? YOU FOUND JESUS!
            break;
            default:
                out<<"You nugga be jealous.";
                return -1;
        }
    }
    return 0;
}