#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

string str;

bool check(string s) {
	if (str.rfind(s) == string::npos) return false;
	else {
		int p = str.rfind(s);
		p += s.size();
		
		bool res = true;
		REP(i, 3) {
			if (p + i >= str.size()) break;
			if (isalnum(str[p + i])) res = false;
		}
		if (p + 3 < str.size()) res = false;
		
		return res;
	}
}

int main() {
	
	while (getline(cin, str)) {
		bool ok = true;
		
		if (str.find(' ') == string::npos) ok = false;
		else {
			int p = str.find(' ') + 1;
			string name = str.substr(0, p - 1);

			FOR(i, p, str.size()) str[i] = tolower(str[i]);
			
			if (name == "digi") {
				if (!check("nyo")) ok = false;
			}
			else if (name == "petit") {
				if (!check("nyu")) ok = false;
			}
			else if (name == "rabi") {
				bool f = false;
				FOR(i, p, str.size()) if (isalnum(str[i])) f = true;
				if (!f) ok = false;
			}
			else if (name == "gema") {
				if (str.find("gema") == str.rfind("gema") || !check("gema")) ok = false;
			}
			else if (name == "piyo") {
				if (!check("pyo")) ok = false;
			}
			else ok = false;
			
		}
		
		puts(ok ? "CORRECT (maybe)" : "WRONG!");
	}
	
	return 0;
}