You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = 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.

Input

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.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.


def find_beautiful(n, q,j=0, firsts=None):
    if firsts is None:
        firsts = set()
    if n == 0:
        return []
    if len(q) == 0:
        return None
    if len(set(q)) < n:
        return None
    for j in xrange(j,len(q)):
        if q[j] not in firsts:
            firsts.add(q[j])
            inds = find_beautiful(n - 1, q,j+1, firsts)
            firsts.remove(q[j])
            if inds is not None:
                return [j] + inds
    return None

def main():
    n = int(raw_input().strip())
    q = raw_input().strip()
    inds = find_beautiful(n,q)
    if inds is None:
        print 'NO'
    else:
        print 'YES'
        for i,j in zip(inds,inds[1:] + [len(q)]):
            print q[i:j]

if __name__ == '__main__':
    main()
