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.ArrayList;
import java.util.Scanner;

public class task_B {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		//ArrayList<String> arr = new ArrayList<String>();
		String[] arr = new String[n];
		String[] arr2 = new String[n];
		boolean check = false;
 		for(int i=0;i<n;i++)
			arr[i] = in.nextLine();
 		String temp = "";
 	    for(int i=0;i<n;i++)
 	    {
 	    	for(int j=1;j<n-i;j++)
 	    	{
 	    		 if(arr[j-1].length() > arr[j].length())
 	    		 {
 	    			temp = arr[j-1];  
                    arr[j-1] = arr[j];  
                    arr[j] = temp; 
 	    		 }
 	    	}
 	    }
 	    
		for(int i=0;i<n-1;i++)
		{
			if(arr[i+1].contains(arr[i]))
			{
				
			}
			else
			{
				System.out.println("NO");
				check=true;
				break;
			}
		}
		if(check==false){
			System.out.println("YES");
			for(int i=0;i<n;i++)
				System.out.println(arr[i]);
		}
	}

}
