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())
S = []
for i in range(n):
    s = input()
    S.append([len(s),s])
S.sort()
if(n==1):
    print("YES")
    print(S[0][1])
else: 
    i=0;j=1;f=-1
    while(i<n-1 and j<n):
        a = S[i][1];b= S[j][1]
        f=-1
        for p in range(0,S[j][0]-len(a)+1):
            if(a==b[p:p+len(a)]):
                f=1
                break
        if(f==1):
            i+=1;j+=1
        else:
            break
    if(f==-1):
        print("NO")
    else:
        print("YES")
        for i in S:
            print(i[1])

