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 = int(input())
l = []
for i in range(n):
    ele = input()
    l.append( ele )
#print(n)
#print(l)

#sort kare
for i in range(len(l)):
    for j in range( len(l) - 1 - i ):
        if len(l[j]) > len(l[j+1]):
            l[j],l[j+1] = l[j+1],l[j]
#print(l)
#l = tuple(l)
#print(l)
        
new = []
i=0
for s in range(len(l)):
    #print(l[s])
    temp = 0
    for single in l[s::]:
        #print(single)
        if l[s] in single:
            temp += 1
            #print(temp)
    if temp == (len(l) - s):
        new.append(l[s])
        #print(new)
#print(new)

if( new == l ):
    print("YES")
    for i in new:
        print(i)
else:
    print("NO")
