L. Cipher
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The Prime Minister of Borland, fearing that his e-mail could be hacked and the correspondence would go public, turned to the computer security laboratory of Borland University, whose employees came up with a new encryption method, for help. They found out that the Prime Minister wrote texts consisting of numbers and lowercase Latin letters, the number of characters in which was equal exactly to the powers of two. They came up with the following method for encrypting a message – all the characters were glued together into one large string of length 2n. Then they flipped the line, then divided it into two parts and flipped each half, then divided it into four parts and flipped every quarter, ... then they divided it by 2n - 1 and flipped each part. However, a little difficulty arose – scientists had not yet figured out how to restore the originally specified string. Your task is to help them write a program to decrypt the message.

Input

A string of length 2n (0 ≤ n ≤ 13) – an encrypted message – is given for input. It

Output

As an answer, output a string of length 2n, consisting of lowercase Latin letters and numbers, which is the answer to the problem.

Examples
Input
2301
Output
0123
Input
mikkmfnz
Output
fmznimkk