import
java.util.*;
public
class
RearrangeString {
static
final
int
N =
100005
;
static
char
[] ans =
new
char
[N];
static
int
[] sieve =
new
int
[N];
static
void
Rearrange(String s,
int
n) {
Arrays.fill(sieve,
1
);
int
sz =
0
;
for
(
int
i =
2
; i <= n /
2
; i++) {
if
(sieve[i] ==
1
) {
for
(
int
j =
1
; i * j <= n; j++) {
if
(sieve[i * j] ==
1
)
sz++;
sieve[i * j] =
0
;
}
}
}
Map<Character, Integer> m =
new
HashMap<>();
for
(
char
c : s.toCharArray())
m.put(c, m.getOrDefault(c,
0
) +
1
);
Vector<Pair> v =
new
Vector<>();
for
(Map.Entry<Character, Integer> entry : m.entrySet())
v.add(
new
Pair(entry.getValue(), entry.getKey()));
v.sort((a, b) -> Integer.compare(a.first, b.first));
if
(v.lastElement().first < sz) {
System.out.println(-
1
);
return
;
}
for
(
int
i =
2
; i <= n; i++) {
if
(sieve[i] ==
0
) {
ans[i] = v.lastElement().second;
}
}
int
idx =
0
;
for
(
int
i =
1
; i <= n; i++) {
if
(sieve[i] ==
1
) {
ans[i] = v.get(idx).second;
v.get(idx).first--;
if
(v.get(idx).first ==
0
)
idx++;
}
System.out.print(ans[i]);
}
}
public
static
void
main(String[] args) {
String str =
"aabaaaa"
;
int
n = str.length();
Rearrange(str, n);
}
static
class
Pair {
int
first;
char
second;
Pair(
int
first,
char
second) {
this
.first = first;
this
.second = second;
}
}
}