You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = q) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.

Input

The first line contains a positive integer k (1 ≤ k ≤ 26) — the number of strings that should be in a beautiful sequence. 

The second line contains string q, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
from sys import stdin
inp = lambda : stdin.readline()

def main():
    n = int(inp())
    s = inp().replace('\n','')
    d = {}
    last = s[0]
    seen = 0
    for i in s:
        if i in d:
            d[last] = (d[last][0] + i,d[last][1])
        else:
            d[i] = (i,seen)
            last = i
        seen += 1
    ans = [d[i] for i in d]
    ans = sorted(ans,key=lambda x: x[1])
    ans = [l[0] for l in ans]
    if n > len(ans):
    	print("NO")
    	exit(0)
    while n < len(ans):
    	ans[0] = ans[0] + ans[1]
    	del ans[1]
    print("YES")
    print("\n".join(ans))
    
    
    
if __name__ == '__main__':
    main()
