Problem Statement
We have a string SS consisting of uppercase English letters. Additionally, an integer NN will be given.
Shift each character of SS by NN in alphabetical order (see below), and print the resulting string.
We assume that A follows Z. For example, shifting A by 22 results in C (A \to→ B \to→ C), and shifting Y by 33 results in B (Y \to→ Z \to→ A \to→ B).
Constraints
-
0 \leq N \leq 260≤N≤26
-
1 \leq |S| \leq 10^41≤∣S∣≤104
-
SS consists of uppercase English letters.
Input
Input is given from Standard Input in the following format:
NNSS
Output
Print the string resulting from shifting each character of SS by NN in alphabetical order.