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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class SubstringsSort 
{

	public static void main(String[] args) throws IOException 
	{
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		int lines = Integer.parseInt(reader.readLine());
		ArrayList<String> all = new ArrayList<String>();
		ArrayList<String> sort = new ArrayList<String>();
		for (int i = 0; i < lines; i++)
			all.add(reader.readLine());
		boolean canSort = true;
		for (int i = 0; i < lines; i++)
		{
			int maxLen = all.get(0).length();
			int ind = 0;
			for (int j = 1; j < all.size(); j++)
				if (all.get(j).length() > maxLen)
				{
					maxLen = all.get(j).length();
					ind = j;
				}
			if (sort.size() > 0)
			{
				if (sort.get(0).contains(all.get(ind)))
					sort.add(0, all.get(ind));
				else
				{
					canSort = false;
					break;
				}
			}
			else
				sort.add(all.get(ind));
			all.remove(ind);
		}
		if (canSort)
		{
			System.out.println("YES");
			for (int i = 0; i < lines; i++)
				System.out.println(sort.get(i));
		}
		else
			System.out.println("NO");
	}

}
