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())
strings = {}
for i in range(n):
    new_s = input()
    if new_s not in strings.keys():
        strings.update({new_s: [1, 0]})
    else:
        strings[new_s][0] += 1
for s1 in strings.keys():
    for s2 in strings.keys():
        if s1 == s2:
            continue
        if s1 in s2:
            strings[s1][1] += 1
if list(range(0, len(strings))) != sorted([strings[s][1] for s in strings.keys()]):
    print("NO")
else:
    print("YES")
    while len(strings) != 0:
        mx = -1
        mx_s = ""
        for s in strings.keys():
            if strings[s][1] > mx:
                mx = strings[s][1]
                mx_s = s
        for i in range(strings[mx_s][0]):
            print(mx_s)
        strings.__delitem__(mx_s)