A word is the nonempty sequence of symbols a₁a₂…a_n. A palindrome is the word a₁a₂…a_n that is read from the left to the right and from the right to the left the same way (a₁a₂…a_n = a_na_n−1…a₁). If S₁ = a₁a₂…a_n and S₂ = b₁b₂…b_m, then S₁S₂ = a₁a₂…a_nb₁b₂…b_m. The input contains some word S₁. You are to find a nonempty word S₂ of the minimal length that S₁S₂ is a palindrome.

The first input line contains S₁ (it may consist only of the Latin letters). It’s guaranteed that the length of S₁ doesn’t exceed 10000 symbols.

S₁S₂.