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.
from sys import stdin; inp = stdin.readline
from math import dist, ceil, floor, sqrt, log
from collections import defaultdict, Counter
def IA(): return list(map(int, inp().split()))
def FA(): return list(map(float, inp().split()))
def SA(): return inp().split()
def I(): return int(inp())
def F(): return float(inp())
def S(): return input()
def O(l:list): return ' '.join(map(str, l))

def main():
    k = I()
    s = S()
    n = len(s)
    _set = sorted(set(s))
    if k > len(_set):
        print('NO')
        return 
    elif k == 1:
        print('YES')
        print(s) 
        return 
    else:
        indexes = []
        for c in _set:
            indexes.append(s.find(c))
            if len(indexes) >= k:
                break 
        if indexes:
            print('YES')
            index = 0 
            for i in range(1, len(indexes)):
                print(s[index:indexes[i]])
                index = indexes[i]
            print(s[index:])
            return 
        else:
            print('NO')
            return 
        
if __name__ == '__main__':
    main()