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.
#!/usr/bin/env python
# -.- coding: utf-8 -.-


def main():
    k = int(input())
    q = input()
    #k = 4
    #q = "abcd"
    sol = []
    if len(q) == 1:
        if k == 1:
            print("YES\n" + q)
        else:
            print("NO")
        return
    beforetrackedindex = 0
    trackedindex = 1
    trackedletter = q[0]
    scounter = 0
    while trackedindex <= len(q):
        while trackedindex < len(q) and q[trackedindex] == trackedletter:
            trackedindex += 1
        scounter += 1
        if scounter == k:
            sol.append(q[beforetrackedindex:])
            print("YES\n" + "\n".join(sol))
            return
        else:
            sol.append(q[beforetrackedindex:trackedindex])
            beforetrackedindex = trackedindex
            trackedindex += 1
            if beforetrackedindex < len(q):
                trackedletter = q[beforetrackedindex]
    print("NO")


if __name__ == "__main__":
    main()
