Given a string $s$ of length $n$, transform the string by swapping the case of each character: convert each uppercase letter to lowercase and each lowercase letter to uppercase.

Input

The first line contains an integer $n \ (1 ≤ n ≤ 100)$, the length of the string.
The second line contains the string $s$ of length $n$, consisting of English letters only (both uppercase and lowercase).

Output

Output the transformed string where each uppercase letter is converted to lowercase, and each lowercase letter is converted to uppercase.