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.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class Main {

	static final double eps = 1e-9;
	static final long mod = 1000000007; // or 1000000009

	public static void main(String[] args) throws Exception {

		SC scan = new SC();
		PrintWriter pw = new PrintWriter(System.out);

		int n = scan.nextInt();
		String[] s = new String[n];
		for(int i = 0; i < n; i++) s[i] = scan.nextLine();
		Arrays.sort(s, new Comp());
		boolean good = true;
		for(int i = 1; i < n; i++)
			if(!s[i].contains(s[i-1])) good = false;
		if(good) {
			pw.println("YES");
			for(String str : s) pw.println(str);
		}
		else pw.println("NO");
		
		
		pw.flush();
	}
	
	static class Comp implements Comparator<String>{
		@Override
		public int compare(String a, String b) {
			return a.length() - b.length();
		}
	}

	
	static void sort(int[] arr) {
		for (int i = 1; i < arr.length; i++) {
			int j = (int) ((i + 1) * Math.random());
			int temp = arr[j];
			arr[j] = arr[i];
			arr[i] = temp;
		}
		Arrays.sort(arr);
	}

	static void sort(long[] arr) {
		for (int i = 1; i < arr.length; i++) {
			int j = (int) ((i + 1) * Math.random());
			long temp = arr[j];
			arr[j] = arr[i];
			arr[i] = temp;
		}
		Arrays.sort(arr);
	}

	static class SC {

		BufferedReader br;
		StringTokenizer st;

		public SC() throws Exception {
			br = new BufferedReader(new InputStreamReader(System.in));
			st = new StringTokenizer("");
		}

		public SC(String fn) throws Exception {
			br = new BufferedReader(new FileReader(fn));
			st = new StringTokenizer("");
		}

		String nextLine() throws Exception {
			return br.readLine();
		}

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

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

		}

		double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}

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