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".
MAX_WORD = '1' * 10000
n = int(input())
a = list()
for i in range(n):
    x = input()
    a.append(x)
a.sort(key=len)
busy = list(False for _ in range(n))
busy[0] = True
ans = list([a[0],])
check = True
i = 0
while i < n and check:
    check = False
    res = MAX_WORD
    for j in range(n):
        if a[j].find(ans[i]) != -1 and len(a[j]) < len(res) and not busy[j]:
            res = a[j]
    for j in range(n):
        if a[j] == res and not busy[j]:
            busy[j] = True
            break
    if res != MAX_WORD:
        ans.append(res)
        check = True
    i += 1
if len(ans) == n:
    print('YES')
    for i in range(n):
        print(ans[i])
else:
    print('NO')
