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".
def mayor(A):
    for i in range(len(A[0])):
        for j in range(len(A[0])):
            if i<j:
                if A[0][j]<=A[0][i]:
                    A[0].insert(i,A[0][j])
                    A[0].pop(j+1)
                    A[1].insert(i,A[1][j])
                    A[1].pop(j+1)
                    A[2].insert(i,A[2][j])
                    A[2].pop(j+1)
    return A
def substring(A,B):
    for i in range(len(B)):
        if B[i]==A[0]:
            k=i
            T=0
            for j in range(len(A)):
                if k<len(B):
                    if B[k]==A[j]:
                        k=k+1
                        T=T+1
                    if T==len(A):
                        return "YES"
    return "NO"
N=input()
W=[]
WF=[]
WI=[]
DATOS=[]
R=[]
k=0
b=0
for i in range(N):
    K=raw_input()
    W.append(K)
    WF.append(len(K))
    WI.append(i)
DATOS.append(WF)
DATOS.append(WI)
DATOS.append(W)
DATOS=mayor(DATOS)
for i in range(len(DATOS[2])-1):
    R.append(substring(DATOS[2][i],DATOS[2][i+1]))
for i in R:
    if i=="YES":
        b=b+1
if b==len(R):
    print"YES"
    for i in DATOS[2]:
        print i
else:
    print"NO"