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"}.
from sys import stdin, stdout    
    

def read_input():    
    #inputfile = open( "A.in" )    
    #input_string_array = inputfile.readlines()
    input_string_array = stdin.readlines()
    k = int (input_string_array[0])
    Q = input_string_array[1].strip()
    return [k, Q]

def is_character_new( beautiful_sequence , last_sequence , new_character  ):
    if last_sequence == new_character:
        return False
    for substring in beautiful_sequence:
        if substring[0] == new_character:
            return False
    return True

def process( k , Q ):
    beautiful_sequence = []
    actual_string = Q[0]
    if  k == 1:
        return [Q]
    for i in range( 1, len(Q) ):
        if is_character_new( beautiful_sequence ,actual_string[0] , Q[i] ):
            beautiful_sequence.append(actual_string)
            actual_string = Q[i]
            k -= 1            
            if k == 1:
                if not Q[i:]:
                    return []
                else:
                    beautiful_sequence.append( Q[i:] )
                    return beautiful_sequence
        else:
            actual_string += Q[i]
    return []



def main():
    [ k , Q ] = read_input()
    beautiful_sequence = process( k , Q )
    if not beautiful_sequence:
        stdout.write("NO"+ '\n')
        
    else:
        stdout.write("YES"+ '\n')
        for subsequence in beautiful_sequence: 
            stdout.write(subsequence+ '\n')

if __name__ == "__main__":
    main() 

