Character Transformation

Problem Description

Xiao Yang has a string of characters that may contain:

• uppercase letters, e.g. $A$, $B$, $C$;
• lowercase letters, e.g. $a$, $b$, $c$;
• digits, e.g. $0$, $1$, $2$.

Now Xiao Yang wants to transform the whole string by the following rules:

1. If it is an uppercase letter, change it to the corresponding lowercase letter;
2. If it is a lowercase letter, change it to the corresponding uppercase letter;
3. If it is a digit, change it to *.

Please transform the whole string for him.

Input Format

The input has $2$ lines.

The first line: an integer, the number of characters in the string.

The second line: a continuous string of characters with no spaces.

Output Format

Output the transformed string.

Note: do not add spaces between the characters in the output.

Sample Input

5
aBc98

Sample Output

AbC**

Sample Explanation

In the first sample, the original string is aBc98. By the rules:

• the first character $a$ is lowercase, transformed to the corresponding uppercase $A$;
• the second character $B$ is uppercase, transformed to the corresponding lowercase $b$;
• the third character $c$ is lowercase, transformed to the corresponding uppercase $C$;
• the fourth character $9$ is a digit, transformed to *;
• the fifth character $8$ is a digit, transformed to *.

So the final output is AbC**.

Constraints

The number of characters does not exceed $1000$. Each character is either an uppercase letter, a lowercase letter, or a digit.