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".
from collections import defaultdict
def output(strs2, n):
    if len(strs2) != n:
        print("NO")
        return
    
    for i in range(n):
        for j in range(i+1,n):
            if strs2[i] not in strs2[j]:
                print("NO")
                return
    print("YES")
    print('\n'.join(strs2))
    
def main():
    n = int(input())
    strs = []
    for i in range(n):
        strs.append(input())
    out_edge = defaultdict(set)
    in_edge = defaultdict(lambda: 0)
    for i in range(n):
        for j in range(i+1, n):
            if strs[i] in strs[j] and strs[i] != strs[j]:
                out_edge[i].add(j)
                in_edge[j] += 1
            if strs[j] in strs[i] and strs[i] != strs[j]:
                out_edge[j].add(i)
                in_edge[i] += 1
    # print(out_edge)
    # print(in_edge)
    dq = [i for i in range(len(strs)) if in_edge[i] == 0] 
    ans = dq[:]
    # print(dq)
    while dq:
        new_dq = []
        for src in dq:
            for dst in out_edge[src]:
                in_edge[dst] -= 1
                if in_edge[dst] == 0:
                    new_dq.append(dst)
                    ans.append(dst)
        dq = new_dq
    strs2 = [strs[i] for i in ans]
    output(strs2, n)

                
                
            

if __name__ == '__main__':
    main()
    