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

public class code2 {


    public static boolean subSet(String s1 , String s2){
        for (int i = 0; i < s2.length(); i++) {
            if(s2.charAt(i)==s1.charAt(0)){
                if(i+s1.length()>s2.length())
                    return false;
                String tmp = s2.substring(i,i+s1.length());
                if(tmp.equals(s1))
                    return true;
            }
        }
        return false;
    }


    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());

        String [] arr = new String[n];


        int max = 0;
        for(int i = 0 ; i<n ; i++){
            arr[i] = br.readLine();
            max = Math.max(max,arr[i].length());
        }



        String [] out = new String[n];
        int c = 0;
        for(int i = 1 ; i<=max ; i++){
            for(int j = 0 ; j<n; j++){
                if(arr[j].length()==i){
                    out[c++] = arr[j];
                }
            }
        }

        for (int i = 0; i < out.length-1; i++) {
            if(!subSet(out[i],out[i+1])){
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
        for(int i = 0 ; i< out.length ; i++){
            System.out.println(out[i]);
        }





    }


}
