k-String

Description

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 s in 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 Input

Input

2
aazz

Output

azaz

Input

3
abcabcabz

Output

-1

这道题，让我知道了字符串也是可以排序的，也让我知道了怎么算一个字符在字符串中的个数。。。。

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
char s[1002];
int st[27], vis[27];
int main()
{
    int n;
    cin >> n;
    scanf("%s",s);
    memset(st,0,sizeof(st));
    memset(vis,0,sizeof(vis));
    int l = strlen(s), flag = 1;
    for(int i = 0; i < l; i++)
    {
        int t = s[i] - 96;
        st[t]++;
        vis[t] = 1;
    }
    for(int i = 1; i <= 26; i++)
        if(vis[i] && st[i]%n!=0)
        {
            flag = 0;
            break;
        }
    if(!flag) cout << "-1" << endl;
    else
    {
        sort(s,s+l);
        for(int i = 1; i <= n; i++)
        {
            for(int j = 0; j < l; j += n)
                cout << s[j];
        }
        cout << endl;
    }
    return 0;
}