#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int n;
	vector<pair<string,string> > s;
	vector<string> s2;
	string in;
	string d1,d2;
	string data = "inabameguru";
	string data1 = "aaeiuu";
	string data2 = "bgmnr";
	string check;
	string c = "aaaaaa";
	int check1[6] = {0,1,2,3,4,5};
	int check2[5] = {0,1,2,3,4};
	bool flg = true;
	map<string, int> cnt;
	
	cin >> n;
	for(int i=0; i<n; i++){
		cin >> in;
		d1 = "";
		d2 = "";
		for(int ii=0; ii<5; ii++){
			d1 += in[ii*2];
			d2 += in[ii*2+1];
		}
		d1 += in[10];
		
		s.push_back( make_pair(d1, d2) );
		s2.push_back(in);
		cnt[d1] ++;
	}
	
	if(n >= 180 * 120){
		cout << "NO" << endl;
		return 0;
	}
	
	sort(s.begin(), s.end());
	sort(s2.begin(), s2.end());
	
	
	do{
		for(int i=0; i<6; i++){
			c[i] = data1[check1[i]];
		}
		
		if(cnt[c] >= 120){
			continue;
		}
		
		for(int i=0; i<5; i++){
			check2[i] = i;
		}
		
		do{
			check = "";
			for(int i=0; i<5; i++){
				check += data1[ check1[i] ];
				check += data2[ check2[i] ];
			}
			check += data1[5];
			
			flg = true;
			for(int i=0; i<n; i++){
				if(check == s2[i]){
					flg = false;
					break;
				}
			}
			
			if(flg){
				cout << check << endl;
			}
		
		}while( next_permutation(check2, check2 + 5) && !flg);
	}while( next_permutation(check1, check1 + 6) && !flg);
	
    
    return 0;
}