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.*;
public class MyClass {
    public static void main(String args[]) {
      Scanner sc=new Scanner(System.in);
      int n=sc.nextInt();
      pair a[]=new pair[n];
      for(int i=0;i<n;i++)
      {
          String x=sc.next();
          a[i]=new pair(x,x.length());
          
      }
      Arrays.sort(a, new Comparator<pair>() { 
            @Override public int compare(pair p1, pair p2) 
            { 
                return p1.b - p2.b; 
            } 
        });
        int count=0;
        for(int i=0;i<n-1;i++)
        {
        String s1=a[i].s;
        int f=0;
        for(int j=0;j<=a[i+1].b-a[i].b;j++)
        {
            String s2=a[i+1].s.substring(j,j+a[i].b);
      
            if(s1.equals(s2))
            {
                      //System.out.println(s2);
                f=1;
            
            break;
            }
            
            
        }
        if(f==0)
        {
           
        System.out.println("NO");
         break;
        }
        else
        {
            count++;
        }
        
        }
        //System.out.println(count);
        if(count==n-1)
        {
            System.out.println("YES");
          for(int i=0;i<n;i++)
          System.out.println(a[i].s);
        }
    }
}
class pair
{
    String s;int b;
    pair(String s,int b)
    {
        this.s=s;
        this.b=b;
    }
}