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 B3 
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		in.nextLine();
		ArrayList<String> al1 = new ArrayList<>();
		ArrayList<String> al2 = new ArrayList<>();
		int min = Integer.MAX_VALUE,index=0,flage=0;
		
		for(int i=0;i<n;i++)
		{
			al1.add(in.nextLine());
		}
		
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<al1.size();j++)
			{
				if(min>al1.get(j).length())
				{
					min = al1.get(j).length();
					index = j;
				}
			}
			
			al2.add(al1.get(index));
			al1.remove(index);
			min = Integer.MAX_VALUE;
		}
		
		for(int i=1;i<al2.size();i++)
		{
			if(!al2.get(i).contains(al2.get(i-1)))
			{
				System.out.println("NO");
				flage=1;
				break;
			}
		}
		
		if(flage==0)
		{
			System.out.println("YES");
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<al2.get(i).length();j++)
					System.out.print(al2.get(i).charAt(j));
				System.out.println();
			}
		}
	}

}
