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())
string_list = []
string_len = []
sorted_list = []
for i in range(n):
    s = input()
    string_len.append(len(s))
    string_list.append(s)
for i in range(n):
    for j in range(i+1,n):
        if(string_len[i]>string_len[j]):
            string_len[i],string_len[j] = string_len[j],string_len[i]
            string_list[i],string_list[j] = string_list[j],string_list[i]
cheak = True
for i in range(n-1):
    if(string_list[i] in string_list[i+1]):
        sorted_list.append(string_list[i])
    else:
        cheak = False
        break
sorted_list.append(string_list[n-1])
if(cheak == True):
    print("YES")
    for x in sorted_list:
        print(x)
else:
    print("NO")
