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 is_substr(s1, s2):
    for i in range(len(s2) - len(s1) + 1):
        if s2[i:i + len(s1)] == s1:
            return True
    return False

def solution():
    n = int(raw_input())
    arr = []
    for i in range(n):
        arr.append(raw_input())
    arr.sort(key=lambda x: len(x))
    for i in range(1, n):
        if len(arr[i]) == len(arr[i - 1]):
            if arr[i] != arr[i - 1]:
                print 'NO'
                return
        elif not is_substr(arr[i - 1], arr[i]):
            print 'NO'
            return
    print 'YES'
    for s in arr:
        print s


if __name__ == '__main__':
    solution()

