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".
#JMD
#Nagendra Jha-4096
 
#a=list(map(int,sys.stdin.readline().split(' ')))
#n,k,s= map(int, sys.stdin.readline().split(' '))
 
import sys
import math
 
#import fractions
#import numpy
 
###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
	ans=''.join(str(i) for i in l)
	return ans
 
 
 
##### Main ####
n=int(input())
s=list()
for i in range(n):
	s.append(str(input()))
s.sort(key = len)
#print(s)
flag=1
for i in range(n-1):
	if(s[i] not in s[i+1]):
		#print(s[i],s[i+1],s[i] in s[i+1])
		flag=0
		break
if(flag):
	print("YES")
	for i in range(n):
		print(s[i])
else:
	print("NO")
