#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int main(){
	int n;cin>>n;
	vector<string> no(n);
	REP(i,n){
		cin>>no[i];
	}
	char c[]={'a','a','e','e','i','u'};
	char m[]={'n','b','m','g','r'};
	sort(c,c+5);
	sort(m,m+5);
	do{
		do{
			string s1,s2;s1.reserve(11);s2.reserve(11);
			s1+=c[0];
			REP(i,5){
				s1+=m[i];s1+=c[i+1];
				s2+=m[i];s2+=c[i];
			}
			s2+=c[5];
			bool f=true;
			REP(i,n) if(s1==no[i]){f=false;break;}
			if(f){cout<<s1<<endl;exit(0);}
			f=true;
			REP(i,n) if(s2==no[i]){f=false;break;}
			if(f){cout<<s2<<endl;exit(0);}
		}while(next_permutation(m,m+5));
	}while(next_permutation(c,c+6));
	return 0;
}