#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cstring>

const int maxn = 1005, maxe = 1000006;

int head[maxn], to[maxe], next[maxe], lb;
int n, P[maxn], idx, cnt;
char R[maxn];
std::string str, now;
std::map<std::string, int> mp;

inline void ist(int aa, int ss) {
	to[lb] = ss;
	next[lb] = head[aa];
	head[aa] = lb;
	++lb;
}
bool cmp(const int aa, const int ss) {
	return aa > ss;
}

int main(void) {
	freopen("dijamant.in", "r", stdin);
	freopen("dijamant.out", "w", stdout);
	memset(head, -1, sizeof head);
	memset(next, -1, sizeof next);
	std::cin >> n;
	char flag;
	int tem;
	int nn = n;
	while (nn--) {
		flag = 0;
		std::cin >> now;
		if (mp.count(now)) {
			std::cout << "greska\n";
			flag = 1;
		}
		std::cin >> str;
		
		if (flag) {
			while (1) {
				std::cin >> str;
				if (!strcmp(str.c_str(), ";")) {
					break;
				}
			}
			continue;
		}
		
		idx = 0;
		memset(R, 0, sizeof R);
		while (1) {
			std::cin >> str;
			if (!strcmp(str.c_str(), ";")) {
				break;
			}
			if (!flag) {
				if (!mp.count(str)) {
					flag = 1;
					std::cout << "greska\n";
				}
				else {
					P[idx++] = mp[str];
				}
			}
		}
		if (flag) {
			continue;
		}
		
		std::sort(P, P + idx, cmp);
		for (int i = 0; i < idx; ++i) {
			tem = P[i];
			if (R[tem]) {
				P[i] = -1;
				continue;
			}
			for (int j = head[tem]; j != -1; j = next[j]) {
				if (R[to[j]]) {
					flag = 1;
					std::cout << "greska\n";
					goto spe;
				}
				else {
					R[to[j]] = 1;
				}
			}
		}
		spe:;
		if (flag) {
			continue;
		}
		
		for (int i = 0; i < cnt; ++i) {
			if (R[i]) {
				ist(cnt, i);
			}
		}
		for (int i = 0; i < idx; ++i) {
			if (P[i] != -1) {
				ist(cnt, P[i]);
			}
		}
		std::cout << "ok\n";
		mp[now] = cnt;
		++cnt;
	}
	return 0;
}