#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

char in[1000000];

int isSame(const char a[], const char b[], int len){
  int i;
  rep(i,len) if(a[i] != b[i]) return 0;
  return 1;
}

int isD(char a){
  if('a' <= a && a <= 'z') return 1;
  if('0' <= a && a <= '9') return 1;
  return 0;
}

int solve(void){
  int i, j, len;

  len = strlen(in);

  REP(i,5,len) if('A'<=in[i]&&in[i]<='Z') in[i] += 'a'-'A';

  if(isSame(in, "digi ", 5)){
    rep(i,4){
      if(isSame(in+len-3, "nyo", 3)) return 1;
      if(isD(in[len-1])) return 0;
      len--;
    }
  }else if(isSame(in, "petit ", 6)){
    rep(i,4){
      if(isSame(in+len-3, "nyu", 3)) return 1;
      if(isD(in[len-1])) return 0;
      len--;
    }
  }else if(isSame(in, "rabi ", 5)){
    REP(i,5,len) if(isD(in[i])) return 1;
  }else if(isSame(in, "gema ", 5)){
    rep(i,4){
      if(isSame(in+len-4, "gema", 4)) return 1;
      if(isD(in[len-1])) return 0;
      len--;
    }
  }else if(isSame(in, "piyo ", 5)){
    rep(i,4){
      if(isSame(in+len-3, "pyo", 3)) return 1;
      if(isD(in[len-1])) return 0;
      len--;
    }
  }

  return 0;
}

int main(){
  while(gets(in)){
    if(solve()) puts("CORRECT (maybe)");
    else        puts("WRONG!");
  }

  return 0;
}