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():
    n = int(input())
    s = str(input())

    if n == 1:
        print("YES")
        print(s)
        return

    mp = dict()
    pos = []
    for i, letter in enumerate(s):
        if letter in mp:
            continue
        else:
            mp[letter] = True
            pos.append(i)

    if len(mp) < n:
        print("NO")
    else:
        print("YES")
        start = 0
        for i in range(n - 1):
            print(s[start: pos[i + 1]])
            start = pos[i + 1]
        print(s[start:])

if __name__ == "__main__":
    solve()




