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".
from sys import stdin, stdout

#Aux
def subst_cmp(str_a, str_b):
	if len(str_a) == len(str_b):
		return 0

	return 1 if len(str_a) > len(str_b) else -1


#Read input
n = [int(x) for x in stdin.readline().rstrip().split()][0]
strings = []

for i in xrange(n):
    strings.append(stdin.readline().rstrip().split()[0])

#Calculate answer
sorted_strs = sorted(strings, cmp = subst_cmp)

achieved_ans = True
for i in xrange(n-1):
	achieved_ans &= sorted_strs[i] in sorted_strs[i+1]
	if achieved_ans is False:
		break

#Print output
if achieved_ans is False:
	stdout.write("NO")
else:
	ans = "YES\n"
	for i in sorted_strs:
		ans += i + "\n"
	stdout.write(ans)