Alphabetical Transformation

You are given a string s consisting of only lowercase letters. Your task is to transform each character in the string to a new character that is 2 positions ahead in the English alphabet. The alphabet wraps around, so if shifting a character goes past 'z', it starts again at 'a'.

For example, the character 'x' becomes 'z', 'y' becomes 'a' and 'z' becomes 'b'.

This problem tests your understanding of character manipulation and modular arithmetic.

inputFormat

The input consists of a single line containing a string s with only lowercase letters. The string will have a length between 1 and 1000.

outputFormat

Output a single line containing the transformed string after each character has been shifted by 2 positions in the alphabet.

abc

cde