#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;
    }

    int n=words.size();
    auto k=words.find_last_of(suffix[name]);

    if (k==string::npos) return false;
    if (k<n-3) return false;
    for(int i=k+1; i<n; ++i) if (isalnum(words[i])) return false;
    return true;
}

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)) {
        string name=s.substr(0, s.find(' '));
        string words=s.substr(s.find(' ')+1);
        for(auto& c: words) c=tolower(c);

        if (correct(words, name))
            cout<<"CORRECT (maybe)"<<endl;
        else
            cout<<"WRONG!"<<endl;
    }
}