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 JavaApplication1 {
    public static void main(String[] args) {

Scanner sc = new Scanner (System.in);
String []ss = new String  [sc.nextInt()];

int max = 0;
int ii=0;
        for (int i = 0; i < ss.length; i++) {
            
            ss[i]=sc.next();
            if(ss[i].length() > max)
            {
                max= ss[i].length();
                ii=i;
            }    
        }
        
        
        boolean flag = true;
        for (int i = 0; i < ss.length; i++) {
            if ( ss[ii].indexOf(ss[i])== -1 )
            {
                flag =false;
                break;
            }
            
        }
        
        if (flag)
        { //System.out.println("YES");
           
            String t="";
            for (int i = 0; i < ss.length; i++) {
               
                    
                for (int j = 0; j < i; j++) {
                    if (ss[i].length()<ss[j].length())
                    {      t=ss[i];
                           ss[i]=ss[j];
                           ss[j]=t;
                    }
                    
                }
                  
            }
            for (int i = 1; i < ss.length; i++) {
                if ( ss[i].indexOf(ss[i-1])==-1)
                {flag=false;
                    System.out.println("NO");
                    return;
                
                }
            }
     
                System.out.println("YES");
                     for(String o :ss)
                     System.out.println(o);
        }
        else
            System.out.println("NO");
     
        
        
        
       
        
        


    }
    
}
