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 bsort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j][1] > arr[j+1][1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]

def contains(s,sub):
	if sub in s:
		return True
	else:
		return False

def valid(arr):
	for i in range(len(arr)-1):
		if contains(arr[i+1],arr[i]):
			continue
		else:
			return False
	return True

def printarr(arr):
	for i in arr:
		print(i)

n = int(input())
l = []
for _ in range(n):
	s = input()
	l.append([s,len(s)])

bsort(l)
fin = []
for i in l:
	fin.append(i[0])

if valid(fin):
	print("YES")
	printarr(fin)
else:
	print("NO")