544_A. Set of Strings
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"}.
```python
from sys import *

k=int(input())
s=input()
ee=set()
for i in s:
    ee.add(i)
if k>len(ee):
    print("NO")
    exit(0)
print("YES")
i=1
cur=s[0]
num=k-1
ee.discard(s[0])
while i<len(s):
    if s[i] in ee and num:
        print(cur)
        ee.discard(s[i])
        num-=1
        cur=s[i]
    else:
        cur+=s[i]
    i+=1
print(cur)
```