codeforces219/A

http://codeforces.com/problemset/problem/219/A

A. k-String

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A string is called a k-string if it can be represented as k concatenated copies of some string. For example, the string "aabaabaabaab" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.

You are given a string s, consisting of lowercase English letters and a positive integer k. Your task is to reorder the letters in the string sin such a way that the resulting string is a k-string.

Input

The first input line contains integer k (1 ≤ k ≤ 1000). The second line contains s, all characters in s are lowercase English letters. The string length s satisfies the inequality 1 ≤ |s| ≤ 1000, where |s| is the length of string s.

Output

Rearrange the letters in string s in such a way that the result is a k-string. Print the result on a single output line. If there are multiple solutions, print any of them.

If the solution doesn't exist, print "-1" (without quotes).

Sample test(s)

input

2
aazz

output

azaz

input

3
abcabcabz

output

-1

#include <string.h>
#include <stdio.h>
#include <iostream>
using namespace std;
int b[10005];
char a[10005];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        getchar();
        int flag=0;
        scanf("%s",a);
        int m=strlen(a);
        memset(b,0,sizeof(b));
        for(int i=0; i<m; i++)
            b[a[i]-'a']++;
        for(int i=0; i<26; i++)
        {
            if(b[i]%n)
            {
                flag=1;
                printf("-1\n");
                break;
            }
        }
        if(flag==0)
        {
            for(int i=0; i<n; i++)
            {
                for(int j=0; j<26; j++)
                    for(int k=0; k<b[j]/n; k++)
                        printf("%c",j+'a');
            }
            printf("\n");
        }
    }
    return 0;
}