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

/**
 *
 * @author Gaurav
 */
public class SubStringSort {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        
        ArrayList<String> al=new ArrayList<>();
        for(int i=0;i<n;i++)
        {
            al.add(sc.next());
        }
        
        Collections.sort(al, new Comparator<String>(){

            @Override
            public int compare(String o1, String o2) {
              if(o1.length()<o2.length()){
                  return -1;
              }  
              else
                  return 1;
            }
            
        });
        
    
        int flag=0;
       for(int i=0;i<al.size()-1;i++)
       {
           String ss=al.get(i+1);
           if(!ss.contains(al.get(i))){
               System.out.println("NO");
               flag=-1;
               break;
           }
       }
       if(flag==0){
        System.out.println("YES");
        
       for(int i=0;i<al.size();i++)
       {
           System.out.println(al.get(i));
       }
       }
    }
   
}
