Hugo wants to give Sunny a string $S$ consisting of lowercase and uppercase letters as his birthday present. Sunny thinks the string $S$ is funny if:

• $S[0], S[2], S[4], \cdots$ are lowercase letters, and
• $S[1], S[3], S[5], \cdots$ are uppercase letters.

Sunny will only accept the present from Hugo if the string $S$ is funny. Help Hugo transform $S$ into a funny string, by converting some letters from lowercase to uppercase, or vice versa.

Input

The only line of input consists of a string $S$.

Output

Output the funny string that $S$ is transformed into.

Constraints

$1 \le |S| \le 10^5$, where $|S|$ is the length of $S$.