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.
Sample Test Cases
Input | Output | |
---|---|---|
7 AbCdEfG |
aBcDeFg | |
6 abcXYZ |
ABCxyz |
Scoring: Per Subtask
Authored by hclee and s17f18
Appeared in 2025 Mini Comp 1