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 func():

    k =  int ( raw_input())
    q = raw_input()

    if ( len(q) < k ):
        print 'NO'
        return 0

    if ( k == 1 ) :
        print 'YES'
        print q
        return 0
    u = [q[0]]
    s = []
    i  = 0
    c = ''
    buff = k
    k = k-1
    for i in range(len(q)):




        if ( k != 0 and q[i] not in u):
            u.append(q[i])
            k = k-1
            s.append(c)
            c = q[i]
        else:
            c = c+ q[i]


        if(k == 0 and i == len(q)-1):
            s.append(c)

    if ( len(u)  == buff ) :
        print "YES"
        for i in s :
            print i
    else:
        print 'NO'













func()
