import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
	
	public static boolean is_vowel(char c){
		return c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o';
	}
	
	public static void dfs(final int deep, char[] input, StringBuilder builder, boolean[] used, HashSet<String> result){
		final char prev = builder.length() == 0 ? 'i' : builder.charAt(builder.length() - 1);
		
		if(deep >= input.length){
			//System.out.println(builder);
			result.add(builder.toString());
			return;
		}
		
		for(int next = 0; next < input.length; next++){
			if(used[next]){ continue; }
			if(!is_vowel(prev) && !is_vowel(input[next])){ continue; }
			
			used[next] = true;
			builder.append(input[next]);
			
			dfs(deep + 1, input, builder, used, result);
			
			builder.deleteCharAt(builder.length() - 1);
			used[next] = false;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final String meguru = "inabameguru";
		
		final int N = sc.nextInt();
		
		HashSet<String> result = new HashSet<String>();
		dfs(0, meguru.toCharArray(), new StringBuilder(), new boolean[meguru.length()], result);
		
		for(int i = 0; i < N; i++){
			result.remove(sc.next());
		}
		
		System.out.println(result.isEmpty() ? "NO" : "YES");
		if(!result.isEmpty()){
			for(String s : result){
				System.out.println(s);
				break;
			}
		}
		
	}
}