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

public class SubstringsSort {
	
	public static void main(String[] args) throws Exception {
		Scanner scanner = new Scanner(System.in);
		StringBuilder builder = new StringBuilder();
		
		ArrayList <String> strings = new ArrayList<String>();
		int n = scanner.nextInt();
		
		for (int i = 0; i < n; i++) {
			strings.add(scanner.next());
			
		}
		int[] count = new int[n];
		for (int i = 0; i < n; i++) {
			String curr = strings.get(i);
			for (int j = 0; j < n; j++) {
				if (i==j) continue;
				if (strings.get(j).contains(strings.get(i))) {
					if (strings.get(i).equals(strings.get(j)) && j > i) {
						count[i]++;
					}
					else if (strings.get(i).equals(strings.get(j)) == false) {
						count[i]++;
					}
				}
			}
		}
		
		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				if (count[j] < count[i]) {
					int temp = count[j];
					count[j] = count[i];
					count[i] = temp;
					String temp2 = strings.get(j);
					strings.set(j, strings.get(i));
					strings.set(i, temp2);
				}
			}
		}
		
		boolean passed = true;
		for (int i = n - 1; i >= 0; i--) {
			if (count[i] != i) {
				passed = false;
				break;
			}
		}
		
		if (!passed) builder.append("NO\n");
		else {
			builder.append("YES\n");
			for (int i = n - 1; i >= 0; i--) {
				builder.append(strings.get(i) + "\n");
			}
		}
		
		System.out.print(builder);		
		scanner.close();
		
	}
}
