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 parting(a,low,high):
    p=high
    fh=low
    for i in range(low,high):
        if(a[i]<a[p]):
            temp=a[i]
            a[i]=a[fh]
            a[fh]=temp
            tempo=s[i]
            s[i]=s[fh]
            s[fh]=tempo
            fh=fh+1
    temp=a[p]
    a[p]=a[fh]
    a[fh]=temp
    tempo=s[p]
    s[p]=s[fh]
    s[fh]=tempo
    return fh
def sorting(a, low, high):
    if (high-low>0):
        p=parting(a,low,high)
        sorting(a,low,p-1)
        sorting(a,p+1,high)

N=int(input())
s=[input() for i in range(0,N)]
l=[len(s[i]) for i in range(0,N)]
sorting(l,0,N-1)
b=0
for i in range(0,N-1):
   if s[i+1].find(s[i])==-1:
       b=1
       break
if(b==1): print("NO")
else:
    print("YES")
    for i in range(0,N):
        print(s[i])