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())
b = list()
for i in range(a):
    c = input()
    b.append(c)
max_len = 0
max_id=0
d = b[0]
for j in range(len(b)):
    for i in range(len(b[:len(b)-j])):
        if len(b[i]) > max_len:
            max_len=len(b[i])
            max_id = i
            d=b[i]
    b = b[:max_id]+b[max_id+1:]
    b.append(d)
    #print(max_len, max_id, b)
    max_len = 0
    max_id = 0
    d=b[0]
flag = True
for i in range(len(b)-1):
    #print(b[i+1], b[i], b[i+1] in b[i])
    if b[i+1] not in b[i]:
        flag = False
        break
if flag:
    print("YES")
    for i in range(len(b)-1,-1,-1):
        print(b[i])
else:
    print('NO')

