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<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ll i,m,n,mrk[200];
    string s;
    while(cin>>n>>s)
    {
        ll m=n,cnt=0;
        memset(mrk,0,sizeof(mrk));
        vector<int>v;
        for(i=0; i<s.size(); i++)
        {
            if(mrk[s[i]]==0)
            {
                v.push_back(i);
                mrk[s[i]]=1;
            }
        }
        if(n==1)
            cout<<"YES\n"<<s<<endl;
        else if(v.size()>=n)
        {
            cout<<"YES\n"<<s[0];
            ll j=1;
            for(i=1; i<s.size(); i++)
            {
                if(v[j]==i && n>1)
                {
                        cout<<"\n";
                        n--;
                        j++;
                }
                cout<<s[i];
            }
            cout<<"\n";
        }
        else
            cout<<"NO\n";
    }

    return 0;
}