#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef pair pii; typedef long long ll; typedef ll int__; #define rep(i,j) for(int__ i=0;i<(int__)(j);i++) #define repeat(i,j,k) for(int__ i=(j);i<(int__)(k);i++) #define all(v) v.begin(),v.end() template ostream& operator << (ostream &os , const vector &v){ rep(i,v.size()) os << v[i] << (i!=v.size()-1 ? " " : "\n"); return os; } template istream& operator >> (istream &is , vector &v){ rep(i,v.size()) is >> v[i]; return is; } #ifdef DEBUG void debug(){ cerr << endl; } #endif template void debug(const F &car,const R&... cdr){ #ifdef DEBUG cerr << car << " "; debug(cdr...); #endif } // 11 // inabameguru // i a a e u u : 6 // n m b g r : 5 // ni na ne nu const string MEGURU = "inabameguru"; const char vowel[] = {'a','i','u','e','o'}; bool is_vowel(char c){ rep(i,5) if(c == vowel[i]) return true; return false; } string ans = ""; set S; bool make(string &s,unsigned int used,int left_vowel){ int left = MEGURU.size() - __builtin_popcount(used); if(left_vowel*2 < left) return false; if(left == 0){ if(is_vowel(s.back()) and not S.count(s)){ ans = s; return true; } return false; } rep(i,MEGURU.size()){ if(used & (1< 0 and not is_vowel(s.back()) and not is_vowel(MEGURU[i])) continue; s.push_back(MEGURU[i]); if( make( s, used | (1<> N; rep(i,N){ string s; cin >> s; S.insert(s); } string s = ""; if( make(s,0,6) ){ cout << ans <