/*

 ID: Starry21

 LANG: C++

 TASK: namenum

 */

 #include<iostream>

 #include<string>

 #include<cstdio>

 #include<cstring>

 #include<map>

 #include<algorithm>

 using namespace std;

 #define N 4617

 map<string,bool> vis;

 char a[];

 string s[];

 int len;

 bool f=;

 void dfs(int i,string n)

 {

     if(i>len)

     {

         //cout<<n<<endl;

         if(vis[n])

         {

             f=;

             cout<<n<<endl;

         }

         return ;

     }

     int t=a[i]-'';

     for(int k=;k<=;k++)

         dfs(i+,n+s[t][k]);

 }

 int main()

 {

     freopen("namenum.in","r",stdin);

     freopen("namenum.out","w",stdout);

     s[]="ABC",s[]="DEF",s[]="GHI",s[]="JKL";

     s[]="MNO",s[]="PRS",s[]="TUV",s[]="WXY";

     scanf("%s",a+);

     string t;

     freopen("dict.txt","r",stdin);

     for(int i=;i<=N;i++)

     {

         cin>>t;

         vis[t]=;

     }

     len=strlen(a+);

     //printf("%d\n",len);

     dfs(,"");

     if(f==) puts("NONE");

     return ;

 }