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.
from sys import stdin
inp = lambda : stdin.readline()

def main():
    n = int(inp())
    s = inp()
    d = {}
    last = s[0]
    seen = 0
    for i in s:
        if i in d:
            d[last] = (d[last][0] + i,d[last][1])
        else:
            d[i] = (i,seen)
            last = i
        seen += 1
    ans = [d[i] for i in d]
    ans = sorted(ans,key=lambda x: x[1])
    ans = [l[0] for l in ans]
    if n > len(ans):
    	print("NO")
    	exit(0)
    while n < len(ans):
    	ans[0] = ans[0] + ans[1]
    	del ans[1]
    print("YES")
    print("\n".join(ans))
    
    
    
if __name__ == '__main__':
    main()
