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.*;
import java.io.*;
import java.lang.*;



public class Main
{


  static void sort(String []s, int n) 
  { 
    for (int i=1 ;i<n; i++) 
    { 
        String temp = s[i]; 
  
        
        int j = i - 1; 
        while (j >= 0 && temp.length() < s[j].length()) 
        { 
            s[j+1] = s[j]; 
            j--; 
        } 
        s[j+1] = temp; 
    } 
  







    
  } 


  public static void main(String[] args)
  {

    Scanner s=new Scanner(System.in);
    int n=s.nextInt();
    String[] a= new String[n];
    for(int i=0;i<n;i++)
    {
      a[i]=s.next();
    }
    
    sort(a,n);
    int count=0;
    for(int i=1;i<n;i++)
    {
      if(a[i].contains(a[i-1]))
      {
        count++;
      }
      else
      {
        System.out.println("NO");
        return;
      }
    }
    if(count<=n)
    {
      System.out.println("YES");
      for(int i=0;i<n;i++)
      {
        System.out.println(a[i]);
      }
    }




    
  



  }
}
