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"}.
#mashup2 
'''
s = input()
d=s[1:]
if (s.upper() == s):
    print(s.lower())

elif (d.upper() == d):
    print(s[0:1].upper(), end = "")
    print(s[1:].lower())
else:
    print(s)


n = int(input())
l = list(map(int,input().split()))
m = int(input())
v=list(map(int,input().split()))
a,b=0,0
d = [0]*(n+1)
for i in range(n) :
	d[l[i]] = i

for q in v:
	a += d[q]+1
	b += n-d[q]
print(a,b)

'''
n=int(input())
s=input()
ss=''
a=set()
if len(set(s))<n:
    print('NO')
else:
     print('YES')
     for i in s:
         if n==0 or i in a:
             ss+=i
         else:
              ss+='\n'+i
              a.add(i)
              n-=1
print(ss)
		  	 			     		 						 		