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

public class SubstringSort {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		
		int n = Integer.parseInt(sc.nextLine());
		
		String[] strings = new String[n];
		for(int i = 0; i < n; i++) {
			strings[i] = sc.nextLine();
		}
		sc.close();
		
		PriorityQueue<String> queue = new PriorityQueue<String>(n, (a, b) -> compareSubstring(a,b));
		
		for(int i = 0; i < n; i++) {
			queue.add(strings[i]);
		}
		
		ArrayList<String> sorted = new ArrayList<String>(n);
		
		for(int i = 0; i < n; i++) {
			String next = queue.poll();
			sorted.add(next);
		}
		
		try {
			for(int i = 0; i < n - 1; i++) {
				if(compareSubstring(sorted.get(i), sorted.get(i+1)) >= 0 
						&& !sorted.get(i).equals(sorted.get(i+1))) {
					throw new NullPointerException();
				}
			}
			pw.println("YES");
			for(int i = 0; i < n; i++) {
				pw.println(sorted.get(i));
			}
		} catch(NullPointerException e) {
			pw.println("NO");
		}
		pw.close();
	}
	
	public static int compareSubstring(String a, String b) {
		if(a.indexOf(b) >= 0) {
			return 1;
		} else if (b.indexOf(a) >= 0) {
			return -1;
		} else {
			return 0;
		}
	}
}
