Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

H. Palindromic Cut

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKolya has a string *s* of length *n* consisting of lowercase and uppercase Latin letters and digits.

He wants to rearrange the symbols in *s* and cut it into the minimum number of parts so that each part is a palindrome and all parts have the same lengths. A palindrome is a string which reads the same backward as forward, such as madam or racecar.

Your task is to help Kolya and determine the minimum number of palindromes of equal lengths to cut *s* into, if it is allowed to rearrange letters in *s* before cuttings.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 4·10^{5}) — the length of string *s*.

The second line contains a string *s* of length *n* consisting of lowercase and uppercase Latin letters and digits.

Output

Print to the first line an integer *k* — minimum number of palindromes into which you can cut a given string.

Print to the second line *k* strings — the palindromes themselves. Separate them by a space. You are allowed to print palindromes in arbitrary order. All of them should have the same length.

Examples

Input

6

aabaac

Output

2

aba aca

Input

8

0rTrT022

Output

1

02TrrT20

Input

2

aA

Output

2

a A

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/25/2019 21:47:24 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|