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 operator
t=int(raw_input())
ls=[]
while(t>0):
	a=raw_input()
	ls.append(a)
	t=t-1


dict1={}


for x in ls:
	count=0
	for z in ls:
		if(x in z):
			count=count+1
	dict1[x]=count

sorted_x = sorted(dict1.items(), key=operator.itemgetter(1))

sorted_x.reverse()
ls2=[]
for x in sorted_x:
	c1=ls.count(x[0])
	for z in range(c1):
		ls2.append(x[0])

flag=1
for i in range(len(ls2)):
	for j in range(i+1,len(ls2)):
		if(ls2[i] not in ls2[j]):
			flag=0
			break
	if(flag==0):
		print("NO")
		break
if(flag==1):
	print("YES")
	for x in ls2:
		print(x)