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".
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	
	
	public static void main (String[] args) throws java.lang.Exception
	{
		Comparator<String> lengthComparator = new Comparator<String>() {
    		@Override    
			public int compare(String o1, String o2) {
        		return Integer.compare(o1.length(), o2.length());
    		}
		};
		
		// your code goes here
		BufferedReader input = new BufferedReader ( new InputStreamReader ( System.in ) );
		String inputString = input.readLine();
		int n=Integer.parseInt(inputString);
		String[] A=new String[n];
		for(int i=0;i<n;i++){
			A[i]=input.readLine();
		}
		Arrays.sort(A,lengthComparator);
		boolean b=true;
		for(int i=1;i<n;i++){
			if(!A[i].contains(A[i-1])){
				b=false;
				break;
			}
				
		}
		if(b){
			System.out.println("YES");
			for(int i=0;i<n;i++)
				System.out.println(A[i]);
		}
		else
			System.out.println("NO");
	}
}