You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *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.
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.
n = int(input())
s = k = input()
if len(s) < n or len(s) == n and len(set(s)) < n or len(set(s))<n :
    print('NO')
elif len(s) == n:
    for i in range(n):
        print(s[i])
        
        
else:
    print('YES')
    r = ''
    for element in s:
        if element not in r:
            r+=element
    
    j = 0
    for i in range(n-1):
        print(s[j:s.find(r[i+1])])
        j = s.find(r[i+1])        
        
        
    print(s[j:])
            
    
        
       
    
    
    
    

