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".
number = int(input())
a = []
m = True
answer = "YES"
def locate(palabra,num):
    if(num > len(a)):
      pass  
    elif(num == 1):
        temp = a[-num]
        a[-num] = palabra
        a.append(temp)
        locate(palabra, 3)
    else:
        if(palabra in a[-num]):
            temp = a[-num]
            a[-num] = palabra
            a[(-num+1)] = temp
            locate(palabra,num+1)
        else:
            if(a[-num] not in palabra):
                global answer
                answer = "NO"
                global m 
                m = False
    
for i in range(number):
    pala = input()
    if(len(a) == 0):
        a.append(pala)
    elif(m == False):
        answer = "NO"
    else:
        if(a[-1] in pala):
            a.append(pala)
        elif(pala in a[-1]):
            locate(pala,1)
        else:
            answer = "NO"
            m = False
if(answer == "NO"):
    print(answer)
else:
    print(answer)
    for i in a:
        print(i)
    