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())
q = input()
b = []
for x in range(len(q)):
  if q[0: x + 1].count(q[x]) == 1:
    b.append(q[x])
  else:
    b[-1] += q[x]
if len(b) >= k:
  print("YES")
  for x in range(k-1):
    print(b[x])
  for y in range(k, len(b)):
    b[k-1] += b[y]
  print(b[k-1])
if len(b) <= k:
  print("NO")
  

