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.IOException;
import java.io.InputStreamReader;


public class JavaApplication9 {

    
    public static void main(String[] args) throws IOException {
        BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(in.readLine());
        String arr[]=new String[n];
        for (int i = 0; i < n; i++) {
           arr[i]=in.readLine();
            
        }
        String cc;
        for (int i = 0; i < arr.length; i++) {
                  
            for (int j = 0; j < arr.length; j++) {
                if(arr[j].length()>=arr[i].length()){
                    cc=arr[i];//aba
                    arr[i]=arr[j];//ab
                    arr[j]=cc;//aba
                }
                
            }           
        }
        for (int i = 0; i < arr.length-1; i++) {
            if((arr[i+1].contains(arr[i]))==false){
                System.out.println("NO");
                return;
            }
        }
        System.out.println("YES");
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
            
        }
    }
    
}
