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".
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking interest
*******************************
I'm standing on top of my Monopoly board
That means I'm on top of my game and it don't stop
til my hip don't hop anymore
https://www.a2oj.com/Ladder16.html
*******************************
300iq as writer = Sad!
*/
import java.util.*;
import java.io.*;
import java.math.*;

   public class B
   {
      public static void main(String hi[]) throws Exception
      {
         BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));
         StringTokenizer st = new StringTokenizer(infile.readLine());
         int N = Integer.parseInt(st.nextToken());
         Thing[] arr = new Thing[N];
         for(int i=0; i < N; i++)
            arr[i] = new Thing(infile.readLine());
         Arrays.sort(arr);
         for(int x=N-1; x > 0; x--)
         {
            String last = arr[x].word;
            for(int i=0; i < x; i++)
            {
               int len = arr[i].word.length();
               boolean pos = false;
               for(int a=0; a < last.length()-len+1; a++)
               {
                  if(arr[i].word.equals(last.substring(a, a+len)))
                     pos = true;
               }
               if(!pos)
               {
                  System.out.println("NO");
                  return;
               }
            }
         }
         System.out.println("YES");
         for(int i=0; i < N; i++)
            System.out.println(arr[i].word);
      }
   }
   class Thing implements Comparable<Thing>
   {
      public String word;
      
      public Thing(String s)
      {
         word = s;
      }
      public int compareTo(Thing oth)
      {
         return word.length()-oth.word.length();
      }
   }