map 用起来真方便
#include<bits/stdc++.h>
using namespace std;
#define Max (int)(1e5+10)
typedef long long ll;
map<ll,vector<string> > f;
int main() {
int key[27]={0,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9,0};
ll n;
cin>>n;
string name;
while(cin>>name)
{
ll t=0;
for(int i=0;i<name.length();i++)
{
t*=10;
t+=key[name[i]-'A'+1];
}
f[t].push_back(name);
}
if(f[n].size()==0)
printf("NONE\n");
else
{
for(int i=0;i<f[n].size();i++)
cout<<f[n][i]<<endl;
}
}