Next Alphabet Transformation

Given a string \( S \), your task is to transform it by replacing each alphabetical character with the character that follows it in the English alphabet. The transformation rules are as follows:

• If the character is a lowercase letter from 'a' to 'y', it is replaced by the next lowercase letter. If it is 'z', it wraps around to 'a'.
• If the character is an uppercase letter from 'A' to 'Y', it is replaced by the next uppercase letter. If it is 'Z', it wraps around to 'A'.
• All non-alphabetical characters remain unchanged.

For example, the string "AbYz" will be transformed into "BcZa".

inputFormat

The input consists of a single line containing the string \( S \). The string may contain letters, digits, and other characters.

outputFormat

Output the transformed string after replacing every alphabetical character with its subsequent character in the alphabet (considering wraparound for 'z' and 'Z').

abc

bcd