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 SubstringsSort
{
	public static void main(String[] g)
	{
		Scanner sc=new Scanner(System.in);
		int n,i,count=0;
		String[] s1;
		n=sc.nextInt();
		s1=new String[n];
		for(i=0;i<n;i++)
			s1[i]=sc.next();
		Arrays.sort(s1,new Length());
		for(i=0;i<(n-1);i++)
		{
			if((s1[i+1].indexOf(s1[i]))!=-1)
				count++;
			else
				break;
		}
		if(count==(n-1))
		{
			System.out.println("YES");
			for(i=0;i<n;i++)
			{
				System.out.println(s1[i]);
			}
		}
		else
			{
				System.out.println("NO");
			}
	}	
}
class Length implements Comparator<String>
{
	public int compare(String s1,String s2)
	{
		if(s1.length()>s2.length())return 1;
		if(s1.length()<s2.length())return -1;
		else
			return 0;
	}
}