Palindrome Fever#12851

Palindrome Fever

1 second
256 megabytes
Easy

You are given a string of lowercase Latin letters. Find any string of lowercase Latin letters of length at most 2\cdot 10^5 such that:

It can be shown that under the constraints of this problem such a string always exists.

Recall that a palindrome is a string that reads the same from left to right and from right to left. For example, abcba is a palindrome, while oppagangnamstyle is not.

Recall that the notation s+t denotes the concatenation of the strings and . For example, energynot + over = energynotover.

Input

The only line contains a string of lowercase Latin letters of length at most 10^5.

Output

Print any non-empty string of lowercase Latin letters of length at most 2\cdot 10^5 satisfying the conditions of the problem.

Note that cannot be empty, even if the empty string satisfies the conditions of the problem.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Note

In the first sample, s+t = t+s = abbaabbaabba, which is a palindrome.

In the second sample, s+t = zyzzzzyz and t+s = zzyzzyzz. Both strings are palindromes.