#include "bits/stdc++.h" using namespace std; #define int long long #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--) #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define ALL(a) (a).begin(),(a).end() #define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end()); #define CONTAIN(a, b) find(ALL(a), (b)) != (a).end() #define array2(type, x, y) array, x> #define vector2(type) vector > #define out(...) printf(__VA_ARGS__) int dxy[] = {0, 1, 0, -1, 0}; void solve(); signed main() { #if DEBUG std::ifstream in("input.txt"); std::cin.rdbuf(in.rdbuf()); #endif cin.tie(0); ios::sync_with_stdio(false); solve(); return 0; } /*================================*/ string name, s; bool is_mark(char c) { if ('a' <= c && c <= 'z') return false; if ('A' <= c && c <= 'Z') return false; if ('0' <= c && c <= '9') return false; return true; } bool check(string s, string last) { REP(i,4) { if (s.size() < last.size() + i) break; bool ok = s.substr(s.size()-last.size()-i, last.size()) == last; REP(j,i) { ok &= is_mark(s[s.size()-1-j]); } if (ok) return true; } return false; } bool check1(string s) { for (auto c:s) { if (!is_mark(c)) return true; } return false; } void solve() { while(true){ cin >> name; if (std::cin.eof()) break; cin.ignore(); getline(cin, s); transform(s.begin(), s.end(), s.begin(), ::tolower); // cout << s << endl; bool ok = false; if (name=="digi") ok = check(s, "nyo"); if (name=="petit") ok = check(s, "nyu"); if (name=="rabi") ok = check1(s); if (name=="gema") ok = check(s, "gema"); if (name=="piyo") ok = check(s, "pyo"); cout << (ok ? "CORRECT (maybe)" : "WRONG!") << endl; } }