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.io.*;
import java.util.*;
public class Train_1998 {
	static Vector<Integer>[]adj;
	static boolean []vis;
	static double sum = 0 ;
	public static void main(String [] args) throws Exception {
		MyScanner in = new MyScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
	  	int n  = in.nextInt();
	  	N[] arr = new N[n];
	  	for(int i = 0 ; i < n ; ++i) {
	  		String s = in.next();
	  		arr[i] = new N(s , s.length());
	  	}
	  	Arrays.sort(arr, new Comparator<N>() {

			@Override
			public int compare(N o1, N o2) {
				// TODO Auto-generated method stub
				return o1.size - o2.size;
			}
	  		
	  	});
	  	int f =0 ;
	  	for(int i = 0 ; i < n; ++i) {
	  		int cnt = 0 ;
	  		for(int j = 0 ; j < i; ++j) {
	  			boolean tmp = arr[i].a.contains(arr[j].a);
	  			if(tmp == true)cnt++;
	  		}
	  		if(cnt == i)f++;
	  	}
	  
	  	if(f == n) {out.println("YES");
	  	for(int i = 0 ; i < n; ++i) {
	  		out.println(arr[i].a);
	  	}
	  	}
	  	else out.println("NO");
		out.flush();
		out.close();
	}
	static class N {
		String a ; int size;
		N(String a , int size){
			this.a = a;
			this.size = size;
		}
		
	}
	static class MyScanner {
        StringTokenizer st;
        BufferedReader bf;

        MyScanner(InputStream in) {
            bf = new BufferedReader(new InputStreamReader(in));
        }

        String next() throws Exception {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(bf.readLine());
            }
            return st.nextToken();
        }

        int nextInt() throws Exception {
            return Integer.parseInt(next());
        }

        long nextLong() throws Exception {
            return Long.parseLong(next());
        }
    }

}
