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.
try:
    n=int(input())
    s=input()
    ans=""
    l=[]
    
    if n>len(s):
        print("NO")
    elif n==1:
        print("YES")
        print(s)
    else:
        ans=s[0]
        
        for i in range(1,len(s)):
            if s[i]==ans[-1]:
                ans+=s[i]
                
            else:
                l.append(ans)
                ans=s[i]
                
                
            if len(l)==n-1 and i<=len(s)-1:
                l.append(s[i:])
                break
                
        if len(l)==n:
            print("YES")
            for i in l:
                print(i)
        else:
            print("NO")
            
            
            
        
        
        
    
        
        
        
        
            
        
            
    


except EOFError:
    pass