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.*;
import java.util.*;

public class Codeforces{
        static int[] sz;
        static int[] id;
    public static void main(String [] args) throws IOException{
        Scanner scan = new Scanner(System.in);
        PrintWriter pr = new PrintWriter(System.out);
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        String[] s = new String[n];
        for(int i=0;i<n;i++){
            s[i]=br.readLine();
        }
        Comparator<String> compare = new Comparator<String>(){
            public int compare(String s1, String s2){
                return s1.length()-s2.length();
            }
        };
        Arrays.sort(s,compare);
        for(int i=1;i<n;i++){
            if(!isSub(s[i-1],s[i])){
                System.out.println("NO");
                return;
            }
        }
        System.out.println("YES");
        for(int i=0;i<n;i++){
            System.out.println(s[i]);
        }
      
        
    }
    static boolean isSub(String a,String b){
        int n = a.length();
        int m = b.length();
        if(n<m){
            String s = a;
            a=b;
            b=s;
            int N=n;
            n=m;
            m=N;
        }
        int[] lps = lpsArray(b);
        int j=0;
        int i=0;
        while(i<n){
            if(a.charAt(i)==b.charAt(j)){
                j++;
                i++;
                if(j==m){
                    return true;
                }
            }
            else{
                if(j!=0){
                    j=lps[j-1];
                }
                else{
                    i++;
                }
            }
        }
        return false;
    }
    static int[] lpsArray(String s){
        int len=0;
        int[] lps = new int[s.length()];
        int i=1;
        lps[0]=0;
        while(i<s.length()){
            if(s.charAt(len)==s.charAt(i)){
                len++;
                lps[i]=len;
                i++;
            }
            else{
                if(len!=0){
                    len = lps[len-1];
                }
                else{
                    lps[i]=len;
                    i++;
                }
                
            }
        }
        return lps;
    }
    

}
