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())
b = {}
a = []
t = 0
x = -1
for _ in range(n):
    a.append(input())
for i in range(n):
    l = len(a[i])
    if l in b:
        p = b[l]
        if p!=a[i]:
            t=t+1
            break
    else:
        b[l]=a[i]
    x = max(l,x)
    if t==1:
        break
if t==1:
    print("NO")
else:
    c = []
    for i in range(1,x+1):
        if i in b:
            c.append(b[i])
    l = len(c)
    i = 0
    while i+1<l:
        if c[i+1].find(c[i])==-1:
            t+=1
            break
        i+=1
    if t==1:
        print("NO")
    else:
        print("YES")
        for i in c:
            for j in a:
                if i==j:
                    print(i)
