#include <iostream>
using namespace std;

int board[9][9]; // 0=empty, 1=rook, 2=queen
int dx[] = {-1,1,0,0,-1,-1,1,1};
int dy[] = {0,0,-1,1,-1,1,-1,1};

bool attacks(int x, int y, int type) {
    int dirs = (type == 1) ? 4 : 8; // rook: 4, queen: 8
    for (int d = 0; d < dirs; d++) {
        int nx = x + dx[d], ny = y + dy[d];
        while (nx >= 1 && nx <= 8 && ny >= 1 && ny <= 8) {
            if (board[nx][ny]) return true;
            nx += dx[d]; ny += dy[d];
        }
    }
    return false;
}

int main() {
    int n;
    cin >> n;
    while (n--) {
        int t, x, y;
        cin >> t >> x >> y;
        if (t == 3) {
            board[x][y] = 0;
            cout << "-" << endl;
        } else {
            // Check if this piece attacks or is attacked
            if (!attacks(x, y, t)) {
                // Also check: does any existing piece attack (x,y)?
                // Since attacks() checks all directions from (x,y),
                // it finds any piece that could attack (x,y) too!
                board[x][y] = t;
                cout << "IGEN" << endl;
            } else {
                cout << "NEM" << endl;
            }
        }
    }
    return 0;
}