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.
k = int(input())
s = input()
a = []
if (k == 1):
    print('YES')
    print(s)
else:
    j = 0
    i = 1
    while (i < len(s)):
        if (k > 0):
            if (s[j] != s[i]):
                if (k - 1 == 0):
                    a.append(s[j::])
                    j = len(s)-1
                    k = k - 1
                else:
                    a.append(s[j:i])
                    j = i
                    k = k - 1
        i = i + 1
    if (k == 0):
        print('YES')
        for i in range(len(a)):
            print(a[i])
    else:
        print('NO')