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.
k = int(input())
s = str(input())
n = len(set(s))
l=len(s)
if(k<=n and k!=0):
    print("YES", end='')
    char=''
    for i in range(l):
        if(k==0):
            print(s[i:l])
            break
        elif (s[i]!=char):
            print()
            print(s[i], end='')
            char=s[i]
            k-=1
        elif(char==s[i]):
                print(s[i], end='')

else:
    print("NO")
