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.*;
import java.math.*;
 
public class B {
    public static void main(String[] args) throws IOException {
        FastScanner fs=new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
 
        // int T=fs.nextInt();
        // for (int tt=0; tt<T; tt++) {
            
        // }
        int n = fs.nextInt();
        String[] arr = new String[n];
        for (int i=0; i<n; i++) {
            arr[i] = fs.next();
        }

        Arrays.sort(arr, new Comparator<String>(){
            public int compare(String a, String b) {
                return a.length()-b.length();
            }
        });
        // out.println(Arrays.toString(arr));
        boolean f = true;
        outer: for (int i=1; i<n; i++) {
            for (int j=0; j<i; j++) {
                // out.println("   "+arr[j]+"should be contained by "+arr[i]);
                if (!arr[i].contains(arr[j])) {
                    f = false;
                    break outer;
                }
                // out.println("       yesyes");

            }
        }
        if (!f) {
            out.println("NO");
        }
        else {
            out.println("YES");
            for (int j=0; j<n; j++) {
                out.println(arr[j]);
            }

        }

 
        out.close();
    }

 
 
    static final Random random=new Random();
    
    static void ruffleSort(int[] a) {
        int n=a.length;//shuffle, then sort 
        for (int i=0; i<n; i++) {
            int oi=random.nextInt(n), temp=a[oi];
            a[oi]=a[i]; a[i]=temp;
        }
        Arrays.sort(a);
    }
    
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }
        
        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
 
}
