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".
a=int(input(''))
t=[]
q=[]
l=[]
z=[]
s=[]
f=0
j=0
d=0
v=0
for i in range(a):
    b=input('')
    t.append(b)
    z.append(len(b))
import copy
x=copy.deepcopy(z)
y=copy.deepcopy(t)
for il in range(len(t)):
    w=z.index(max(z))
    z.remove(z[w])
    j=0   
    for kl in range(len(t)):
        if(not(t[j] in t[w])):
            break
        else:
            f=f+1
        
        j=j+1     
    t.remove(t[w])
if(f==int(a*(a+1)/2)):
    print('YES')
    for it in range(len(x)):
        e=x.index(min(x))
        l.append(y[e])
        x.remove(x[e])
        y.remove(y[e])
    for kll in range(len(l)):
        print(l[v])
        v=v+1
else:
    print('NO')

    
    
    
