#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()



bool is_char(char c) { return (32 <= c && c <= 126); }
bool is_symbol(char c) { return (is_char(c) && !isalnum(c)); }

string convert_lower(string S)
{
	for (int i = 0; i < S.size(); i++)
		if (isupper(S[i])) S[i] -= ('A' - 'a');
	return S;
}

bool is_correct_end(const string S, const string end)
{
	if (S.size() < end.size()) return false;
	if (convert_lower(S.substr(S.size() - end.size())) == end) return true;
	if (convert_lower(S.substr(S.size() - end.size() - 1, end.size())) == end && is_symbol(S.back())) return true;
	if (convert_lower(S.substr(S.size() - end.size() - 2, end.size())) == end && is_symbol(S[S.size() - 2]) && is_symbol(S[S.size() - 1])) return true;
	if (convert_lower(S.substr(S.size() - end.size() - 3, end.size())) == end && is_symbol(S[S.size() - 3]) && is_symbol(S[S.size() - 2]) && is_symbol(S[S.size() - 1])) return true;
	return false;
}

bool is_correct(const string S)
{
	if (S[0] != 'd' && S[0] != 'p' && S[0] != 'r' && S[0] != 'g') return false;
	if (S.size() < 4) return false;
	istringstream iss(S);
	string ch;
	if (!(iss >> ch)) return false;
	if (ch.size() < 4) return false;
	if (S.find(' ') == string::npos) return false;
	string T = S.substr(S.find(' ') + 1);

	if (ch == "rabi") {
		for (int i = 0; i < T.size(); i++)
			if (!is_symbol(T[i])) return true;
		return false;
	}

	if (ch == "gema") {
		if (T.size() < 4) return false;
		return is_correct_end(S, "gema");
	}

	if (T.size() < 3) return false;

	if (ch == "digi") return is_correct_end(S, "nyo");
	if (ch == "petit") return is_correct_end(S, "nyu");
	if (ch == "piyo") return is_correct_end(S, "pyo");
	
	return false;
}

int yuki0380()
{
	string S;
	while (getline(cin, S)) {
		cout << (is_correct(S) ? "CORRECT (maybe)" : "WRONG!") << endl;
	}

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0380();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}