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.math.*;
import java.awt.geom.*;
public class Solve{
    public static void main(String[] args) {
      MyScanner sc=new MyScanner();
      int n=sc.ni();
      String arr[]=new String[n];
      for(int i=0;i<n;i++) arr[i]=sc.next();
      Comparator<String> comp=new Comparator<String>(){
        public int compare(String s1, String s2){
          if(s1.length()>=s2.length()) return 1;
          else return -1;
        }
      };
      Arrays.sort(arr, comp);
      for(int i=0;i<n-1;i++){
        String curr = arr[i];
        String next = arr[i+1];
        if(curr.length()==next.length()){
          if(curr.compareTo(next)!=0){System.out.println("NO"); System.exit(0);}
        }
        else{
          if(next.indexOf(curr)==-1){System.out.println("NO"); System.exit(0);}
        } 
      }
      System.out.println("YES");
      for(String s:arr)
        System.out.println(s);
  }


    private static class MyScanner {
      BufferedReader br;
      StringTokenizer st;

      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }

      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }

      int ni() {
          return Integer.parseInt(next());
      }
      float nf() {
        return Float.parseFloat(next());
      }
      long nl() {
          return Long.parseLong(next());
      }

      double nd() {
          return Double.parseDouble(next());
      }

      String nextLine(){
          String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
      }
   }
}