B. Symmetric Encoding

Polycarp has a string 𝑠, which consists of lowercase Latin letters. He encodes this string using the following algorithm:

• first, he constructs a new auxiliary string 𝑟, which consists of all distinct letters of the string 𝑠, written in alphabetical order;
• then the encoding happens as follows: each character in the string 𝑠 is replaced by its symmetric character from the string 𝑟 (the first character of the string 𝑟 will be replaced by the last, the second by the second from the end, and so on).

For example, encoding the string s="codeforces" happens as follows:

• the string 𝑟 is obtained as "cdefors";
• the first character 𝑠1='c' is replaced by 's';
• the second character 𝑠2='o' is replaced by 'e';
• the third character 𝑠3='d' is replaced by 'r';
• ...the last character 𝑠10='s' is replaced by 'c'.

The string 𝑟 and replacements for 𝑠="codeforces".

Thus, the result of encoding the string 𝑠="codeforces" is the string "serofedsoc".

Write a program that performs decoding — that is, restores the original string 𝑠 from the encoding result.