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