#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
    
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    vector<char> v, c;
    v = { 'a','i','u','u','e' };
    c = { 'n','b','m','g','r' };
    sort(v.begin(), v.end());
    sort(c.begin(), c.end());
    set<string> ss;
    do {
        do {
            string s1, s2;
            for (int i = 0; i < c.size(); i++) {
                s1 += c[i];
                s1 += v[i];

            }
            ss.emplace(s1);
        } while (next_permutation(c.begin(), c.end()));
    } while (next_permutation(v.begin(), v.end()));
    int n; cin >> n;
    for (int kkt = 0; kkt < n; kkt++) {
        string s; cin >> s;
        auto itr = ss.find(s);
        if (itr != ss.end()) ss.erase(itr);
    }
    if (!ss.empty()) cout << *ss.begin() << endl;
    else cout << "NO" << endl;
    return 0;
}