#C6273. Alphabet Transformation

    ID: 50015 Type: Default 1000ms 256MiB

Alphabet Transformation

Alphabet Transformation

You are given a single line string consisting of alphabetical characters. Your task is to transform the string by replacing each character by its successor in the English alphabet. In particular, the character 'z' should be transformed to 'a' and 'Z' to 'A'.

More formally, for each character c in the input string, compute the following:

\(f(c)=\begin{cases}\text{'a'}, & \text{if } c = \text{'z'}\\ \text{'A'}, & \text{if } c = \text{'Z'}\\ \chi(c)+1, & \text{otherwise} \end{cases}\)

For example, transforming "AzBY" yields "BaCZ".

inputFormat

The input consists of a single line containing the string to be transformed. The string only contains English alphabetical characters.

outputFormat

Output the transformed string on a single line to standard output.

## sample
abcdef
bcdefg