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".
// CodeForces Round #669 C competition

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class SubstringsSort {
	
	static class CompLen implements Comparator<String> {

		@Override
		public int compare(String a, String b) {
			return a.length() - b.length();
		}		
	}

	int n;
	String []a;
	boolean can;

	private void readData(BufferedReader bin) throws IOException {
		String s = bin.readLine();
		String []ss = s.split(" ");
		n = Integer.parseInt(ss[0]);
		a = new String[n];
		for (int i = 0; i < n; i++) {
			s = bin.readLine();
			a[i] = s.trim();
		}
	}

	void printRes() {
		if (can) {
			System.out.println("YES");
			for (String s : a) {
				System.out.println(s);
			}
			System.out.println();			
		} else {
			System.out.println("NO");
		}
			
	}	

	private void calculate() {
		// sort by length
		Arrays.sort(a, new CompLen());
		can = true;
		String last = "";
		for (String s : a) {
			if (last.length() == s.length()) {
				if (!s.equals(last)) {
					can = false;
					break;
				}
			} else {
				if (s.indexOf(last) < 0) {
					can = false;
					break;
				}
			}
			last = s;
		}
	}

	public static void main(String[] args) throws IOException {
		// BufferedReader bin = new BufferedReader(new FileReader("cactus.in"));
		BufferedReader bin = new BufferedReader(
				new InputStreamReader(System.in));
		SubstringsSort l = new SubstringsSort();
		l.readData(bin);
		l.calculate();
		l.printRes();
	}
}
