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.Scanner;

public class Solution {
public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int n = sc.nextInt();
	String[] strings = new String[n];
	boolean YES =false;
	
	for (int i =0; i < n ;i++)
	{
	strings[i] = sc.next();	
	}
	sc.close();
	
	//sort by length
	insertionSort(strings);
		
	for (int i =0; i< strings.length; i++)
	{
		if (i!= strings.length-1)
		{
			//check if strings[i] is a substring of strings[i+1]
			YES = checkIfIsSubstring(strings[i], strings[i+1]);
			if (!YES)
			break;
		}
	}
	if (n ==1)
		YES = true;
	
	if(YES)
	{
		System.out.println("YES");
		
		for (int j=0; j< strings.length; j++) {
		 System.out.println(strings[j]); }
		 
	}
	else
	{
		System.out.println("NO");
	}
		
}

static boolean checkIfIsSubstring(String string1, String string2)
{
	boolean result = false;
	char[] string1Arr = string1.toCharArray();
	char[] string2Arr = string2.toCharArray();
	
//	int[] startingIndices = new int[string2Arr.length];
//	int numberOfIndices=0;
	int startingI = -1;
	int startingJ = -1;
	int matchingLetters = 0;
	
	for(int i =0; i< string1Arr.length; i++)
	{
//		startingIndices = new int[string2Arr.length];
//		numberOfIndices=0;
		for (int j =0 ; j< string2Arr.length; j++)
		{
			matchingLetters = 0;
			if(string1Arr[i] == string2Arr[j])
			{
				matchingLetters++;
				result = true;
				startingI = i+1;
				startingJ = j+1;
				while(startingI <= string1Arr.length-1 && startingJ <= string2Arr.length-1)
				{
					if (string1Arr[startingI] == string2Arr[startingJ] )
						{
							matchingLetters++;
							result = true;
							startingI++;
							startingJ++;
						}
					else
					{
						result = false;
						break;
					}
						
				}
				if (result && matchingLetters != string1Arr.length )
					result = false;
				if (result)
					return result;
			}
		}
	}
	
	return result;
}

static void insertionSort(String[] arr)
{
	for(int i =1; i< arr.length; i++)
	{
		insert(arr, i-1, arr[i]);
	}
}

static void insert(String[] array, int rightIndex, String value)
{
	int i=rightIndex;
	for(i = rightIndex; i>=0 && array[i].length() > value.length(); i--)
	{
		array[i+1] = array[i];
	}
	array[i+1] = value;
}
}
