k-String

- **题面翻译如下** ## 题目描述 如果一个字符串可以被划分为 $k$ 个相同的子串，则称这个字符串为 $k$-string。例如，字符串“aabaabaabaab”同时是 $1$-string, $2$-string和 $4$-string，但它不是 $3$-string, $5$-string 或 $6$-string 等。显然，任何字符串都是 $1$-string。 给你一个由小写英文字母组成的字符串 $s$ 和一个正整数 $k$。你需要将字符串 $s$ 重新排列成一个 $k$-string。 ## 输入格式 第一行，一个正整数 $ k $ ($ 1\le k \le 1000 $)。 第二行，一个由小写英文字母组成的字符串 $ s $，（$ 1<=|s|<=1000 $， $ |s| $ 表示字符串 $s$ 的长度）。 ## 输出格式 - 共一行，一个经过重新排列后的字符串。如果存在多种排列方案，输出其中任意一种即可。 - 如果不存在解决方案，则输出“-1”（不含双引号）。

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.

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 $ .

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).

2
aazz

azaz

3
abcabcabz

-1