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".
import functools

n = int(input())

words = [input() for i in range(n)]

byLen = [[] for i in range(101)]

for w in words:
    byLen[len(w)].append(w)

# print(byLen)

possible = True
result = []
for i in range(100, 0, -1):
    if len(byLen[i]) == 0:
        continue
    
    allEqual = True
    first = byLen[i][0]
    for w in byLen[i][1:]:
        if w != first:
            allEqual = False
            break
    
    if not allEqual:
        possible = False
        break

if not possible:
    print("NO")
    exit()

words.sort(key = lambda w: len(w))

for i in range(len(words) - 1):
    if not words[i] in words[i + 1]:
        possible = False
        break

if possible:
    print("YES")
    for w in words:
        print(w)
else:
    print("NO")