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 S13
{
    public static void main(String[] args)throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(br.readLine());
        String[] str=new String[n];
        for(int i=0;i<n;i++)
        {
            str[i]=br.readLine();
        }
        Arrays.sort(str,new Comparator<String>()
        {
            public int compare(String s1,String s2)
            {
                return (int)(s1.length()-s2.length());                 
            }
        });
        int flag=1;
        for(int i=0;i<n-1;i++)
        {
            if(!str[i+1].contains(str[i]))
            {
                flag=-1;
                System.out.println("NO");
                break;
            }
        }
        if(flag==1)
        {
            System.out.println("YES");
            for(int j=0;j<n;j++)
            {
                System.out.println(str[j]);
            }
        }
        /*
        for(int j=0;j<n;j++)
        {
        int re=0;
        String x=str[j].s;
        for(int k=0;k<n;k++)
        {
        if((str[k].s).contains(x))
        {
        re++;                    
        }
        }
        str[j].rep=re;
        }
        Arrays.sort(str,new Comparator<st>()
        {
        public int compare(st s1,st s2)
        {
        return (int)(s2.rep-s1.rep);
        }
        });
        int co=0;
        for(int l=0;l<n;l++)
        {
        if(str[l].rep==1)
        {
        co++;
        }
        }
        if(co>1)
        {
        System.out.println("NO");
        }
        else
        {
        System.out.println("YES");
        for(int l=0;l<n;l++)
        {
        System.out.println(str[l].s);
        }
        }
         */
    }
}