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 DFS(depth, start, str, used):
    if start >= len(str):
        return None
    if str[start] in used:
        return None
    if depth == 1:
        return [str[start:]]
    for i in range(start, len(str)):
        res = DFS(depth - 1, i + 1, str, used + str[start])
        if res != None:
            return res + [str[start:i+1]]
    return None


def main():
    k = int(input())
    str = input()
    res = DFS(k, 0, str, "")
    if res == None:
        print("NO")
    else:
        print("YES")
        res.reverse()
        for token in res:
            print(token)


if __name__ == '__main__':
    main()