Text decryption

A simple yet unknown mathematical method $X$ was used to encrypt texts made up of only lower-case letters, upper-case letters, spaces and punctuation characters. For every such text $t$ , denote by $X(t)$ the result of encrypting $t$ with $X$ . It is known that for two texts $t_1 \neq t_2$ , $X(t_1) \neq X(t_2)$ .

Write a program to decrypt a text that was encrypted with $X$ . Deduce $X$ from the sample input and the sample output below.

Input

Input consists of one text encrypted with $X$ , that is, $X(t)$ . It has at most 1000 lines, each one with at most 1000 characters.

Output

Print the text such that, once encrypted, produced $X(t)$ , that is, the original text $t$ .

Problem information

Author: Salvador Roura

Generation: 2026-01-25T11:37:43.137Z