|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||1||1||1||100.000%|
A word is a palindrome if and only if it remains the same when read backwards. A palindrome is even if it has an even positive number of letters.
The word abaaba is an example of an even palindrome.
An even palindrome decomposition of a word is its division into separate parts, every one of which is an even palindrome.
For the word:
the following are even palindrome decompositions:
bb aa bb aa bb baaaaaaaaaaaab bb aa
The first decomposition consists of the least possible number of even palindromes, and the second one is a decomposition having the maximal possible number of even palindromes.
Notice that a word might have many different even palindrome decompositions or might have no such a decomposition.
Write a program which:
The standard input contains one word consisting of at least 1 and at most 200 small letters of English alphabet. The word is written in one line with no spaces between letters.
We assume that the given word is written correctly in the standard input, and your program need not verify that.
The standard output should contain:
bbaabb aabbbaaaaaaaaaaaabbbaa bb aa bb aa bb baaaaaaaaaaaab bb aa