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.Collections;
import java.util.Iterator;
import java.util.Scanner;
import java.util.Vector;
public class Node 
{

		String s;
		//int c;
		Node next;
		public Node(String x,Node n)
		{
			s=x;
			
			next=n;
		}

	

	public static void main(String[] args)
	{
     Scanner sc=new Scanner(System.in);
     Node[] head=new Node[101];
     Vector<String> v=new Vector();
     Vector<Integer> v1=new Vector();
     int n=sc.nextInt();
     int max=-1;
     for(int i=0;i<n;i++)
     {
    	 String s=sc.next();
    	 int l=s.length();
    	 
    	 if(i==0)
    		 v1.add(l);
    	 else
    	 {
    		 if(v1.contains(l))
    		 {
    			 if(head[l].s.equals(s)==false)
    				{
    				 
    				 System.out.println("NO");
    				 System.exit(0); 
    				}
    		 }
    		 else
    			v1.add(l);
    		 
    	 }
    	 if(l>max)
    		 max=l;
    	 head[l]=new Node(s,head[l]);
    	 //System.out.println(0);
     }
     
    //System.out.println(v1.size());
      Collections.sort(v1);
      Collections.reverse(v1);
      int[] a=new int[v1.size()];
   Iterator<Integer> it =v1.iterator();
   int h=0;
      while(it.hasNext())
      {
    	  
    	  a[h]=it.next();
    	  h++;
      }
      
     for(Node n1=head[max];n1!=null;n1=n1.next)
     {
    	 //System.out.println(max);
    	 v.add(n1.s);
     }
    // System.out.println(a.length);
     /*for(int i=0;i<a.length;i++)
     {
    	 System.out.println(a[i]);
     }*/
     for(int i=1;i<a.length;i++)
     {
    	 String s1=head[a[i]].s;
    	 String s2=head[a[i-1]].s;
    	 if(s2.indexOf(s1)!=-1)
    	 {
    		
    		 for(Node n1=head[a[i]];n1!=null;n1=n1.next)
    		 {
    			 v.add(n1.s);
    		 }
    	 }
     }
     
     if(v.size()==n)
     {
    	 Collections.reverse(v);
    	System.out.println("YES");
    	Iterator<String> itr=v.iterator();
    	while(itr.hasNext())
    	{
    	  System.out.println(itr.next());	
    	}
     }
     else
    	 System.out.println("NO");
     
	}

}
