#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>
#include <fstream>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

bool iskigou(char c) {
  if(isalpha(c)) return false;
  if(isdigit(c)) return false;
  return true;
}

void seriseri(char* serihu) {
  int i =0;
  while(serihu[i] != 0) {
    if(isalpha(serihu[i]))
      if(isupper(serihu[i]))
        serihu[i] += 'a' - 'A';
    i++;
  }
}

void ng() {
  cout << "WRONG!" << endl;
}

int main() {

  char c;
  static char serihu[10000000], name[10000000];
  int k = 0;
  bool hasSpace = 0;
  while ( (c=fgetc(stdin)) != EOF) {
    if(c == '\n') {
//      cout << "\"" << name << "\"" << " " << "\"" << serihu << "\"" << endl;
      serihu[k] = 0;
      seriseri(serihu);

      int f = 0;
      string matu;

      if(0 == strcmp(name, "digi")) f = 0;
      else if(0 == strcmp(name, "petit")) f = 1;
      else if(0 == strcmp(name, "piyo")) f = 2;
      else if(0 == strcmp(name, "gema")) f = 3;
      else if(0 == strcmp(name, "rabi")) f = 4;
      else { ng(); goto ex; }

      if(f < 3 && k < 3) { ng(); goto ex; }
      else if(f == 3 && k < 4) { ng(); goto ex; }

      switch (f) {
        case 0: matu = "nyo"; break;
        case 1: matu = "nyu"; break;
        case 2: matu = "pyo"; break;
        case 3: matu = "gema"; break;
        case 4: ; break;
        default: assert(0);
      }

      if(f < 4) {
        int i = 0;
        if(iskigou(serihu[k - 1])) {
          while(i < 3 && iskigou(serihu[k - 1 - i])) i++;
        }
        reverse(all(matu));
        bool ngflag = 0;
        for(auto c: matu) {
          if(k - 1 - i < 0) {
            ngflag = 1; break;
          }
          if(c != serihu[k - 1 - i]) {
            ngflag = 1; break;
          }
          i ++;
        }
        if(ngflag) { ng(); goto ex; }
      }
      else {
        bool ok = 0;
        rep(i, k) if(!iskigou(serihu[i])) ok = 1;
        if(!ok) { ng(); goto ex; }
      }

      cout << "CORRECT (maybe)" << endl;

    ex:;
      hasSpace = 0;
      k = 0;
      continue;
    }

    if(!hasSpace && c == ' ') {
      name[k] = 0;
      k = 0;
      hasSpace = 1;
      continue;
    }

    if(hasSpace) {
      serihu[k++] = c;
    }
    else {
      name[k++] = c;
    }
  }
  
  return 0;
}