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".
//package Day6;

import java.util.Scanner;

public class b {
    static String base[];
    static  int len[];
    public static void main(String[]args){
        Scanner in =new Scanner(System.in);
        int s=in.nextInt();
        base=new String[s];
        len=new int[s];
        for(int h=0;h<s;h++){
            base[h]=in.next();
            len[h]=base[h].length();
        }
        for(int i=0;i<s-1;i++){
            for(int j=i+1;j<s;j++){
                if(len[j]<len[i])
                    swap(i,j);
            }
        }
        boolean jdg=true;
       // for(int i=0;i<s;i++){
         //   System.out.println(len[i]+" "+base[i]);
        //}
        for(int i=0;i<s-1;i++){
            auto tar=new auto(base[i+1],base[i]);
            int c=tar.search();
            if(c==0) {
                jdg = false;
                break;
            }
        }
        if(jdg==false)
            System.out.println("NO");
        else{
            System.out.println("YES");
            for(int j=0;j<s;j++){
                System.out.println(base[j]);
            }
        }
    }
    static void swap(int  a,int  b){
        String s=base[a];
        base[a]=base[b];
        base[b]=s;
        int h=len[a];
        len[a]=len[b];
        len[b]=h;
    }
    static class auto {
        private String base;
        private String pattern;
        public auto(String base,String pattern){
            this.base=base;
            this.pattern=pattern;
        }
        public int[] makenxt(){
            int len=pattern.length();
            int nxt[]=new int[1000005];
            nxt[0]=0;
            int i=1,j=0;
            for(;i<len;i++){
                while (j>0&&pattern.charAt(i)!=pattern.charAt(j)){
                    j=nxt[j-1];
                }
                if(pattern.charAt(i)==pattern.charAt(j))
                j++;
                nxt[i]=j;
            }
            return nxt;
        }
        public int search(){int lenb=base.length();//is sz
            int lenp=pattern.length();//is m
            int []nxt=makenxt();
            int count=0;
            int i=0,j=0;
            for(;i<lenb;i++){
                while ((j>=lenp)||(j>0&&base.charAt(i)!=pattern.charAt(j)))
                    j=nxt[j-1];
                if(base.charAt(i)==pattern.charAt(j))
                    j++;
                if(j==lenp)
                    count++;
            }
            return count;
        }
    }
}
