#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
set<string> S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	string a,b;
	
	return _P("NO\n");
	cin>>N;
	FOR(i,N) cin>>s, S.insert(s);
	
	a="iaaeuu";
	b="nbmgr";
	vector<int> v,v2;
	FOR(i,6) v.push_back(i);
	FOR(i,5) v2.push_back(i);
	
	do {
		do {
			string c="           ";
			FOR(i,5) c[i*2]=a[v[i]],c[i*2+1]=b[v2[i]];
			c[10]=a[v[5]];
			if(S.count(c)==0) return _P("%s\n",c.c_str());
		} while(next_permutation(ALL(v2)));
	} while(next_permutation(ALL(v)));
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}