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.*;

public class a
{
    static boolean multiple_testcases = false;
        
    static void solve() {
        int n = in.nextInt();
        ArrayList<String> list = new ArrayList<>();
        for(int i=0;i<n;i++) {
            list.add(in.next());
        }
        Collections.sort(list, new Comparator<String>(){
            @Override
            public int compare(String one, String two) {
                if(one.length()==two.length())
                    return one.compareTo(two);
                else return one.length() - two.length();
            }
        });
        

        
        for(int j=0;j<list.size()-1;j++) {
            String s = list.get(j);
            String last = list.get(j+1);
            int lastlen = last.length();
            int len = s.length();
            boolean flag = false;
            for(int i=0;i<lastlen-len+1;i++) {
                if(s.equals(last.substring(i,i+len))) {
                    flag = true;
                    break;
                }
            }
            if(!flag) {
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
        for(String s : list) {
            System.out.println(s);
        }
    }

    static int INF = Integer.MAX_VALUE;
    static FastReader in = new FastReader();
    public static void main(String[] args) { 
        if(multiple_testcases) {
            int t = in.nextInt();
            while(t-- >0)  solve();
        } else solve();
    }

    static class FastReader { 
        BufferedReader br; StringTokenizer st; 
        public FastReader() { 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 nextInt() { return Integer.parseInt(next()); } 
        long nextLong() { return Long.parseLong(next()); } 
        double nextDouble() { return Double.parseDouble(next()); } 
        char nextChar() { return next().charAt(0); }
        String nextLine() { String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } 
        return str; }
     
        int[] intArray(int n) {
            int[] arr = new int[n];
            for(int i=0;i<n;i++) 
                arr[i] = in.nextInt();
            return arr;    
        } 
        int[] intArray1(int n) {
            int[] arr = new int[n+1];
            for(int i=1;i<=n;i++) 
                arr[i] = in.nextInt();
            return arr;    
        } 
    } 
}