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.
#include<stdio.h>
#include<string.h>
int main()
{
    int i, j, k, l, x, y, z, len;
    char str[5000];
    scanf("%d", &k);
    getchar();
    gets(str);
    len = strlen(str);

    if(len < k){
        printf("NO");
    }
    else{
        y = 0;
        printf("YES\n");
        x = len / k;
        for(i = 0; i < len; i++){
            printf("%c", str[i]);
            if((i + 1) % x == 0){
                y++;
                printf("\n");
            }
            if(y == k - 1) break;
        }

        for(i = i + 1 ; i < len; i++){
            printf("%c", str[i]);
        }

    }



    return 0;
}
