#include <iostream>
#include <string>
#include <map>
#include <cctype>
using namespace std;

map<string, string> suffix;

bool correct(const string& words, const string& name)
{
    if (name=="rabi") {
        for(auto& c: words) if (isalnum(c)) return true;
        return false;
    }
    if (!suffix.count(name)) return false;

    string suf=suffix[name];
    int m=suf.size();
    if (words.size()+3<m) return false;

    int n=words.size();
    for(int i=n-1; i>=n-4; --i) if (isalnum(words[i])) {
        if (i+1<m) return false;
        return words.substr(i+1-m, m)==suf;
    }
    return false;
}

int main()
{
    string names[]={"digi", "petit", "gema", "piyo"};
    string suffs[]={"nyo", "nyu", "gema", "pyo"};
    for(int i=0; i<4; ++i) suffix[names[i]]=suffs[i];

    string s;
    while (getline(cin, s)) {
        auto k=s.find(' ');
        if (k!=s.npos and k+1<s.size()) {
            string name=s.substr(0, k);
            string words=s.substr(k+1);
            for(auto& c: words) c=tolower(c);
            cout<<(correct(words, name) ? "CORRECT (maybe)" : "WRONG!")<<endl;
        }
        else {
            cout<<"WRONG!"<<endl;
        }
    }
}