Mirror Alphabet String

You are given a string s consisting of lowercase English letters. Your task is to compute its mirror string by replacing each character with its counterpart from the opposite end of the alphabet.

The transformation is defined as follows: each letter c is replaced by the letter given by the formula $$mirror(c) = \text{'a'} + (\text{'z'} - c)$$ in ASCII code. In other words, 'a' is replaced by 'z', 'b' by 'y', ..., and 'z' by 'a'.

For example, the mirror of "abc" is "zyx" and the mirror of "hello" is "svool".

inputFormat

The input consists of a single line containing a string s (1 ≤ |s| ≤ 1000) composed exclusively of lowercase English letters.

outputFormat

Output a single line containing the mirror string corresponding to the input.

abc

zyx