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():
    n = int(input())
    s = input()
    result = []
    substring = []
    d = set()

    for i in range(len(s)):
        if n > 0 and s[i] not in d:
            if len(substring) > 0 :
                result.append(''.join(substring))
                substring = []
            substring.append((s[i]))
            d.add(s[i])
            n -= 1
        else:
            substring.append((s[i]))

    if len(substring) > 0 :
        result.append(''.join(substring))
    if n > 0:
        print('NO')
        return
    else:
        print('YES')
        for s in result:
            print(s)






if __name__ == '__main__':
    main()