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())

t=[]
while n>0:
    x=str(input())
    t.append(x)
    n-=1
f=1
t.sort(key=len)

y=len(t)-1
h=0

#print(y,t[y])
while h<len(t)-1:
    z = h+1
    while z<len(t):
        if t[h] not in str (t[z]):
            f=0
            break
        z+=1
    h+=1


#while h<len(t)-1:
 #   while z<len(t)-1:


  #  if t[h] not in str(t[h+1:]):
   #     #print(t[h],t[h+1:])
    #    print("NO")
     #   f = 0
        #break
    #print(t[h+1:])
    #h+=1

if f==1:

    print("YES")
    print("\n".join(t))
else :
    print("NO")
