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".
o=int(input())
uk=[]
gh=0
uo=0
for i in range(o):
    yu=input()
    if(len(yu)>gh):
        gh=len(yu)
        uo=i
    uk.append(yu)
        
yk=0
yj={}

td=0  
uk.sort()
for i in range(len(uk)-1):
    for j in range(i+1,len(uk)):
        if(len(uk[j])<len(uk[i])):
            t=uk[j]
            uk[j]=uk[i]
            uk[i]=t
for i in range(1,len(uk)):
    j=i
    while(j>=0):
        if(uk[i].count(uk[j])==0):
            td=1
        j=j-1
if(td==0):        
    print('YES')   
    for i in uk:
        print(i)            
else:   
    print('NO')
