#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 2005;
int n;
bitset<1005> P[mxN];
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n;
map<string,int> mp; vector<int> A;
ff(i,1,n){
string X; cin >> X;
bool ok = (mp.count(X) == 0);
string s; cin >> s; vector<int> vec;
while(1){
cin >> s;
if(s == ";")break;
if(mp.count(s))vec.pb(mp[s]);
else ok = 0;
}
if(ok == 0){
cout << "greska" << '\n';
continue;
}
P[i].set(i);
for(auto c : vec){
P[i] |= P[c];
}
for(auto a : A){
if(P[i][a] == 0)continue;
for(auto b : A){
if(!P[i][b] || P[a][b] || P[b][a])continue;
if((P[a] & P[b]).any()){
ok = 0;
break;
}
}
if(ok == 0)break;
}
if(ok == 1){
mp[X] = i;
A.pb(i);
}
cout << (ok == 0 ? "greska" : "ok") << '\n';
}
return 0;
}
/*
13
1 : ;
2 : 1 ;
3 : 1 ;
4 : 2 ;
5 : 3 ;
6 : 4 5 ;
7 : 4 5 ;
8 : 4 5 ;
9 : 4 5 ;
10 : 2 3 ;
11 : 2 4 ;
12 : 4 3 :
13 : 2 1 :
// probati bojenje sahovski
*/
