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 codeforce
{
 static class Key
{
  String str;
  int val;
  Key(String str,int val)
  {
    this.str=str;
    this.val=val;
  }
}
static class MyComparator implements Comparator<Key>
{
  public int compare(Key o1,Key o2)
  {
    Integer i1=o1.val;
    Integer i2=o2.val;
    return i2.compareTo(i1);
  }
}
    
    public static void main(String[] args)throws IOException
    {
      
       BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
       int i=0;
        
         int n=Integer.parseInt(bf.readLine().trim());

        
         PriorityQueue<Key> pq=new PriorityQueue(new MyComparator());
         for(i=0;i<n;i++)
         {
           String so=bf.readLine().trim();
           pq.offer(new Key(so,so.length()));
         }
         Stack<String> s=new Stack();
         Key k1=new Key("#",-1);
         k1=pq.poll();
         String s1=k1.str;
         s.push(s1);
         int flag=0;
         while(pq.size()!=0)
         {
          // System.out.println(k1.str+" "+k1.val);
              k1=pq.poll();
              String s2=s.peek();
              s1=k1.str;
              if(s2.contains(s1))
              {
                s.push(s1);
              }
              else
              {
                flag=1;
                break;
              }
         }
        // System.out.println(s);
         if(flag==0)
            {
              System.out.println("YES");
             while(s.size()!=0)
             {
               String str1=s.pop();
               System.out.println(str1);
             }

            }
            else 
            System.out.println("NO");

         
         
         
          
           

    }     
}
