text: # Problem 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).Examples Input 2 aazz Output azaz Input 3 abcabcabz Output -1 # Solution from collections import Counter import string import math import sys def array_int(): return [int(i) for i in sys.stdin.readline().split()] def vary(number_of_variables): if number_of_variables==1: return int(sys.stdin.readline()) if number_of_variables>=2: return map(int,sys.stdin.readline().split()) def makedict(var): return dict(Counter(var)) mod=100000007 k=vary(1) s=input() tt=makedict(list(s)) ans='' for i in tt: if tt[i]%k!=0: print(-1) exit() else: ans+=i*(tt[i]//k) print(ans*k)