#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()

int N,T;
map<string, bool> has;
signed main()
{
    cin >> N;
    string s;
    REP(i,N) {
        cin >> s;
        has[s] = true;
    }
    string vowels = "iaaeuu";
    string consonants = "tnbmgr";
    string t = "";
    bool ok = false;
    do {
        do {
            t = "";
            REP(i,6) {
                char c = consonants[i];
                if (c != 't') t += c;
                t += vowels[i];
            }
            if (!has[t]) {
                ok = true;
                break;
            }
        }while(next_permutation(ALL(consonants)));
        if (ok) break;
    }while(next_permutation(ALL(vowels)));

    if (ok) {
        cout << t << endl;
    } else {
        cout << "NO" << endl;
    }
    return 0;
}