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.util.Scanner;
import java.lang.String;
public class main
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int n=input.nextInt();
        String ch = input.nextLine();
        String[] a= new String[n];
        for(int i=0 ; i<n ; i++)
        {
            a[i] = input.nextLine();
           // System.out.println(a[i]);
        }
        int s=0;
        int h=0;
        for(int i= 0 ; i<n ; i++)
        {
            for(int j=0 ; j<n; j++ )
            {
                s=0;

                if(a[i].length() <= a[j].length()) {
                    for (int k = 0; k <= a[j].length() - a[i].length(); k++) {
                        if (a[i].equals(a[j].substring(k, k + a[i].length() ))) {
                            s = 1;
                           // System.out.println(i +" "+j);
                        }
                    }
                    if(s==0)
                    {
                        h=1;
         //               System.out.println(i+" "+j);
                    }
                }

            }
        }
        if(h==1)
        {
            System.out.println("NO");
        }
        else
        {
            System.out.println("YES");
            for(int i =1 ; i<=100 ; i++)
            {
                for(int j = 0 ; j< n ;j++)
                {
                    if(a[j].length() == i)
                    {
                        System.out.println(a[j]);
                    }
                }
            }
        }
    }
}
