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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class SubstringSort {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(br.readLine());
		ArrayList<String> arr = new ArrayList<String>();

		for(int i = 0; i < n; i++) {
			arr.add(br.readLine());
		}

		Collections.sort(arr,new Comparator<String>() {
			public int compare(String s1, String s2) {
				return s1.length() - s2.length();
			}
		});
		
		LinkedList<String> strings = new LinkedList<String>();
		strings.add(arr.get(0));
		boolean couldBe = true;
		for(int i = 1; i < arr.size(); i++) {
			String s = arr.get(i);
			String last = strings.getLast();
			if(s.length() == last.length()) {
				if(!s.equals(last)) {
					couldBe = false;
					break;
				}
			} else {
				for(String str : strings) {
					if(!s.contains(str)) {
						couldBe = false;
					}
				}
				strings.add(s);
			}
		}
		if(couldBe) {
			StringBuilder sb = new StringBuilder("YES\n");
			for(String s : arr) {
				sb.append(s + "\n");
			}
			System.out.print(sb.toString());
		} else {
			System.out.println("NO");
		}
	}
}