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".
def substring(s1,s2):
    if len(s1)>len(s2):
        return s2 in s1
    else:
        return s1 in s2

d={}

for _ in range(int(input())):
    s=input().strip()
    if len(s) in d.keys():
        d[len(s)].append(s)
    else:
        d[len(s)]=[s]

flag=1
for i in sorted(d.keys()):
    if len(d[i])>1:
        for j in d[i]:
            if not substring(d[i][0],j):
                flag=0
                break

arr=[]
for i in sorted(d.keys()):
    arr.append(d[i][0])
    
for i in range(len(arr)-1):
    if not substring(arr[i],arr[i+1]):
        flag=0
        break
    
if flag==1:
    print("YES")
    for i in sorted(d.keys()):
        for j in d[i]:
            print(j)
else:
    print("NO")

        


    