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".
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package codeforces;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;

/**
 *
 * @author Hemant Dhanuka
 */
public class B1 {
    public static void main(String[] args) {
         Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        ArrayList<String> al=new ArrayList(n);
        
        for(int i=0;i<n;i++){
           String str=s.next();
            al.add(str);
        }
        
        Collections.sort(al, new Comparator<String>() {
             @Override
             public int compare(String o1, String o2) {
                 if(o1.length()!=o2.length()){
                     return o1.length()-o2.length();
                 }
                 else{
                     return -1;
                 }
             }
         });
        
            for(int i=0;i<al.size();i++){
                for(int j=i+1;j<al.size();j++){
                    boolean res=subStringMatching(al.get(i), al.get(j));
                    if(res==false){
                        System.out.println("NO");
                        return;
                    }
                }
            }
            
            System.out.println("YES");
            for(int i=0;i<al.size();i++){
                System.out.println(al.get(i));
            }

    }

    private static boolean subStringMatching(String chotiVali, String BadiVali) {
       
     if(BadiVali.contains(chotiVali)){
         return true;
     }
     return false;
    }
    
    
   
}
