#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll inf=1e18;


int main(){

    string s;
    map<string, string> m;
    m["digi"] = "nyo";
    m["petit"] = "nyu";
    m["gema"] = "gema";
    m["piyo"] = "pyo";
    string line, name;
    while (getline(cin, line)) {
        stringstream ss(line);
        ss >> name;
        if (line == name || !isalpha(line[0])) {
            cout << "WRONG!" << endl;
            continue;
        }
        line = line.substr(name.size() + 1);
        if (name == "rabi") {
            if (find_if(line.begin(), line.end(), [](char c){return isalnum(c);}) != line.end()) {
                cout << "CORRECT (maybe)" << endl;
            } else {
                cout << "WRONG!" << endl;
            }
        } else {
            if (!m.count(name)) {
                cout << "WRONG!" << endl;
                continue;
            }
            for (char& c : line) c = tolower(c);
            reverse(line.begin(), line.end());
            int cnt = find_if(line.begin(), line.end(), [](char c){return isalnum(c);}) - line.begin();
            reverse(line.begin(), line.end());
            if (cnt <= 3 && cnt + m[name].size() <= line.size() && m[name] == line.substr(line.size() - cnt - m[name].size(), m[name].size())) {
                cout << "CORRECT (maybe)" << endl;
            } else {
                cout << "WRONG!" << endl;
            }
        }
    }

    return 0;
}