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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Comparator;
import java.util.Arrays;
import java.io.IOException;

public class Main{
     
    
    public static void main (String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        
        int numberCads = Integer.parseInt(br.readLine()); 
        String cad[] = new String[numberCads]; 
        for(int i=0; i<cad.length; i++){
            cad[i] = br.readLine();
        }
        
      SubstringComparator comp = new SubstringComparator();
    
      
      Arrays.sort(cad, comp);
      if(!comp.getContains()){
        bw.write("NO\n");  
      }else{
        bw.write("YES\n");
        for(int i=0; i<cad.length; i++){
            bw.write(cad[i]+"\n");
        }
      }
        br.close();
        bw.close();
    }
    
    public static class SubstringComparator implements Comparator<String> {
          private boolean contains=true;
          
          public boolean getContains(){
              return contains;
          }
          public int compare(String a1, String a2){
              int comp = 0;
              if(a1.equals(a2)){
                comp=0;    
              }else if(a1.contains(a2)){
                  comp=1;
              }else if(a2.contains(a1)){
                  comp=-1;
              }else{
                  contains=false;
              }
              return comp;
          }
      }
}