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.Arrays;
import java.util.Scanner;

public class B988 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt(), i;
		specialString[] strs = new specialString[n];
		String waste = in.nextLine();
		
		for(i = 0; i < n; i++) {
			strs[i] = new specialString(in.nextLine());
		}
		
		Arrays.sort(strs);
		
		for(i = 1; i < n; i++) {
			if(!strs[i].s.contains(strs[i-1].s)) {
				System.out.print("NO");
				System.exit(0);
			}
		}
		System.out.println("YES");
		for(i = 0; i < n; i++) {
			System.out.println(strs[i].s);
		}
	}
	
	
	public static class specialString implements Comparable<specialString> {

		public String s;
		
		public specialString(String inputString) {
			s = inputString;
		}
		public int compareTo(specialString ss) {
			if(s.contains(ss.s))
				return 1;
			if(ss.s.contains(s))
				return -1;
			return 0;
		}
		
	}
}