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".
#####################################   
import atexit, io, sys, collections, math, heapq
buffer = io.BytesIO() 
sys.stdout = buffer
@atexit.register 
def write(): sys.__stdout__.write(buffer.getvalue())   
##################################### 
# 1 + 3 + 3^2 + 3^3 + ... + 3 ^5

#7 6 18 6 16 18 1 17 17
#6 9 3 10 9 1 10 1 5


n = int(raw_input())
ws = [raw_input() for _ in range(n)]
ws.sort(key = lambda x:len(x))
def g(a,b):
	for i in range(len(b)):
		if b[i:i+len(a)] == a:
			return True
	return False
def f(ws):
	for i in range(1, len(ws)):
		if not(g(ws[i-1],ws[i])):
			return False
	return True
if f(ws):
	print 'YES'
	for w in ws:
		print w
else:
	print 'NO'
