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".
#  http://codeforces.com/contest/988/problem/B
n=int(input())
h=[]
for i in range(n):
    h.append(input())
h.sort(key = lambda s: len(s))
ans="YES"
for i in range(0,n-1):
    if h[i] not in h[i+1]:
        ans="NO"
print (ans)
if ans is "YES":
    for i in h:
        print (i)

# def list_to_dict(lst):
#     knt=0
#     for i in lst:
#         s[i]=knt
#         knt+=1
#     return s
# def find(s, ss): # s= string ss=substring
#     return s.find(ss) != -1
# def in_string(s,ss):
#     return ss in s
# def index(s, ss):# s= string ss=substring
#     try:
#         s.index(ss)
#     except ValueError:
#         return False
#     else:
#         return True
#
# def sort_by_length(lst):  #sorts list members by length of the members
#     lst.sort(key = lambda s: len(s))
#     return lst
