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.
def solve():
    # read the input
    k = int(input())
    s = input()
    
    # Step 2
    ans = []
    used = set()
    
    # Step 3 & Step 4
    cur = ''
    for char in s:
        if char not in used: # Step 4.a
            used.add(char)
            cur += char
        else: # Step 4.b
            ans.append(cur)
            cur = char
    if cur: # not empty
        ans.append(cur)
    
    # Step 5
    if len(ans) < k:
        print("NO")
        return

    # Step 6
    for i in range(len(ans)-1, k-1, -1):
        ans[-2] += ans[-1]
        ans.pop() # remove last element

    # Step 7
    print("YES")
    print("\n".join(ans))

solve()