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".
n = input()
d = {}
for i in xrange(1, 101):
	d[i] = []
g = []
for i in xrange(n):
	s = raw_input()
	g.append(s)
	d[len(s)].append(s)
f = 0
ans = []
for i in xrange(1, 101):
	if len(list(set(d[i]))) > 1:
		f = 1
		break
if f == 1:
	print 'NO'
else:
    for i in xrange(1, 101):
        if len(d[i]) > 0:
    		x = d[i][0]
    		for j in xrange(i + 1, 101):
    			if len(d[j]) > 0:
    				if x not in d[j][0]:
    					f = 1 
    					break
    		if f == 1:
    			break
    		for a in d[i]:
    			ans.append(a)
    if f == 1:
        print 'NO'
    else:
        print 'YES'
        for a in ans:
            print a