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 insert(strarr, st):
    i = 0
    while i < len(strarr):
        if len(st) < len(strarr[i]):
            return strarr[:i] + [st] + strarr[i:]
        i += 1
    return strarr + [st]           

def is_substr(sub, parent):
    for j in range(len(parent) - len(sub) + 1):
        for i in range(len(sub)):
            if sub[i] != parent[j + i]:
                break
            if i == len(sub) - 1:
                return True

    return False

n = int(input())
st = []
for _ in range(n):
    st = insert(st, input())

#checking
ret = True
for i in range(n - 1):
    if not is_substr(st[i], st[i + 1]):
        ret = False
        break

if ret:
    print('YES')
    for s in st:
        print(s)
else:
    print('NO')