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

public class SolutionB{
	public static BufferedReader cin;
	public static StringTokenizer tok = null;

	public static String nextToken() throws IOException{
		if (tok == null || !tok.hasMoreTokens()){
			tok = new StringTokenizer(cin.readLine());
		}

		return tok.nextToken();
	}

	public static int nextInt() throws IOException{
		return Integer.parseInt(nextToken());
	}

	public static double nextDouble() throws IOException{
		return Double.parseDouble(nextToken());
	}

	public static long nextLong() throws IOException{
		return Long.parseLong(nextToken());
	}

	public static void main(String[] args) throws IOException{
		cin = new BufferedReader(new InputStreamReader(System.in));

		int n = nextInt();

		String[] strs = new String[n];
		for (int i = 0; i < n; ++i){
			strs[i] = nextToken();
		}

		for (int i = 0; i < n; ++i){
			for (int j = i; j < n; ++j){
				String tmp = strs[j];
				if (strs[i].length() > strs[j].length()){
					strs[j] = strs[i];
					strs[i] = tmp;
				}
			}
		}

		String ans = "YES";

		for (int i = 0; i < n - 1; ++i){
			if (!strs[i + 1].contains(strs[i])) ans = "NO"; 
		}

		System.out.println(ans);
		if (ans.equals("YES")){
			for (int i = 0; i < n; ++i){
				System.out.println(strs[i]);
			}
		}
	}
}