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 main():
    k, q, l, res = int(input()), input(), [True] * 123, []
    for i, c in enumerate(q):
        if l[ord(c)]:
            l[ord(c)] = False
            res.append(i)
            k -= 1
            if not k:
                res.append(101)
                print("YES")
                print('\n'.join(q[i:j] for i, j in zip(res, res[1:])))
                return
    print("NO")


if __name__ == "__main__":
    main()
