#codefestival2015qualBa. [codefestival_2015_qualB_a]Double String

[codefestival_2015_qualB_a]Double String

Problem Statement

It is 10/25/2015 today.

This date has an interesting property as a string: all letters contained in this string (1, 0, 2, 5, /) appear exactly twice in this string.

We will call such a string double: a string TT is double if and only if any letter that appears at least once in TT appears exactly twice in TT.

You are given a string SS consisting of lowercase alphabets. Construct and print a double string that contains all letters in SS.

Your output may contain letters that are not in SS, but may not contain letters other than lowercase alphabets.


Input

Input is given from Standard Input in the following format:

SS

  • The first line contains a string S(1S10)S (1 ≦ |S| ≦ 10).
  • SS consists of lowercase alphabets.
  • No letter appears more than once in SS.

Output

Print a double string consisting of lowercase alphabets that contains all letters in SS. When there are multiple solutions, any of them will be accepted. Print a newline at the end of output.


Sample Input 1


on

Sample Output 1


noon

These solutions will also be accepted: onno, onon, oonn and lemonmelon.


Sample Input 2


meat

Sample Output 2


teammate