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.util.logging.LoggingPermission;
// http://codeforces.com/contest/988/problem/B

public class cf_substringssort
{
    public static void main(String args[]) throws IOException {
        BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
        
        long arr[], arr2[][], k, num, t, temp, len, sum = Long.MIN_VALUE, count = 0, diff = Long.MAX_VALUE, rem, ans;
        int i, j, n, m;
        char ch, crr[];
        String s = "", srr[];
        StringTokenizer st;
        boolean flag = true;
    
        n = Integer.parseInt(buf.readLine());
        
        srr = new String[n];
        
        for(i = 0; i < n; i++)
            srr[i] = buf.readLine();
    
        Arrays.sort(srr, (a, b)->Integer.compare(a.length(), b.length()));
        
        if(n == 1)
        {
            System.out.println("YES");
            System.out.println(srr[0]);
        }
        else
        {
            for(i = 1; i < n; i++)
            {
                if(!srr[i].contains(srr[i-1]))
                    flag = false;
            }
    
            if(flag)
            {
                System.out.println("YES");
                for(i = 0; i < n; i++)
                    System.out.println(srr[i]);
            }
            else
            {
                System.out.println("NO");
            }
        }
    }
}
