You are given n strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.

String a is a substring of string b if it is possible to choose several consecutive letters in b in such a way that they form a. For example, string "for" is contained as a substring in strings "codeforces", "for" and "therefore", but is not contained as a substring in strings "four", "fofo" and "rof".

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of strings.

The next n lines contain the given strings. The number of letters in each string is from 1 to 100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder n given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and n given strings in required order.

Examples

Input

5
a
aba
abacaba
ba
aba


Output

YES
a
ba
aba
aba
abacaba


Input

5
a
abacaba
ba
aba
abab


Output

NO


Input

3
qwerty
qwerty
qwerty


Output

YES
qwerty
qwerty
qwerty

Note

In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".
import java.util.*;

public class Problem {

	private static void sortArray(String s[]) 
	{ 
		int n = s.length;
	    for (int i=1 ;i<n; i++) 
	    { 
	        String temp = s[i];
	        int j = i - 1; 
	        while (j >= 0 && temp.length() < s[j].length()) 
	        { 
	            s[j+1] = s[j]; 
	            j--;
	        } 
	        s[j+1] = temp; 
	    } 
	} 
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		String[] str = new String[n];
		str[0] = sc.next();
		if(n != 1){
			for (int j = 1; j < n; j++) {
				str[j] = sc.next();
			}
			sortArray(str);
			for(int k = 1; k < n; k++) {
				if(! str[k].contains(str[k-1])){
					System.out.println("NO");	
					break;
				}
				else{
					if(k == n-1)
					{
						System.out.println("YES");	
						for (int l = 0; l < n; l++) {
							System.out.println(str[l]);
						}
					}
					continue;
				}
			}
		}
		else
		{
			System.out.println("YES");
			for (int l = 0; l < n; l++) {
				System.out.println(str[l]);
			}
		}
	}

}
