#include <iostream> #include <algorithm> #include <vector> #include <string> #include <set> void solve() { std::vector<std::string> vow, con; { std::string s = "aaeiuu"; do { vow.push_back(s); } while (std::next_permutation(s.begin(), s.end())); s = "bgmnr"; do { con.push_back(s); } while (std::next_permutation(s.begin(), s.end())); } std::vector<std::string> ss; for (int b = 0; b < (1 << 11); ++b) { if (__builtin_popcount(b) != 5 || ((b >> 10) & 1) || (b & (b >> 1))) continue; for (const auto& s : vow) { for (const auto& t : con) { std::string r; int si = 0, ti = 0; for (int i = 0; i < 11; ++i) { if ((b >> i) & 1) { r.push_back(t[ti++]); } else { r.push_back(s[si++]); } } ss.push_back(r); } } } std::set<std::string> ts; { int n; std::cin >> n; while (n--) { std::string t; std::cin >> t; ts.insert(t); } } for (const auto& s : ss) { if (ts.count(s)) continue; std::cout << s << "\n"; return; } std::cout << "NO\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }