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.
import sys
import math
import collections
import bisect
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
for t in range(1):
    n=int(input())
    string=list(get_string())
    if len(set(string))<n:
        print("NO")
        continue
    selected=set()
    selected.add(string[0])
    ans=[]
    left=0
    counted=0
    for i in range(1,len(string)+1):
        if counted==n-1:
            sub_string=string[left:]
            ans.append(sub_string)
            break
        else:
            sub_string=string[left:i]
        if sub_string[-1] not in selected:
            ans.append(sub_string[:-1])
            left=i-1
            counted+=1
    print("YES")
    for i in ans:
        print(*i,sep="")