Output the "Kin" String

Problem Description

Write a program to compute the "kin string" $s_1$ of a given string $s$.

The kin string $s_1$ is defined as follows: take the first character of $s$, add its ASCII value to the ASCII value of the second character of $s$, to get the first kin character; take the second character of $s$, add its ASCII value to the ASCII value of the third character, to get the second kin character; and so on, until the second-to-last character of $s$. The last character of the kin string is obtained by adding the ASCII value of the last character of $s$ to the ASCII value of the first character of $s$.

Input Format

The input gives one line: a string of length between 2 and 100 inclusive. Each character of the string has an ASCII value no greater than 63.

Output Format

Output one line: the transformed kin string. The input guarantees the transformed string has exactly one line.

Sample Input

1234

Sample Output

cege