Problem:
Score : 200 points

Problem Statement

We have a string S consisting of uppercase English letters. Additionally, an integer N will be given.

Shift each character of S by N in alphabetical order (see below), and print the resulting string.

We assume that A follows Z. For example, shifting A by 2 results in C (A \to B \to C), and shifting Y by 3 results in B (Y \to Z \to A \to B).

Constraints

0 \leq N \leq 26

1 \leq |S| \leq 10^4

S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the string resulting from shifting each character of S by N in alphabetical order.

Sample Input 1

2
ABCXYZ

Sample Output 1

CDEZAB

Note that A follows Z.

Sample Input 2

0
ABCXYZ

Sample Output 2

ABCXYZ

Sample Input 3

13
ABCDEFGHIJKLMNOPQRSTUVWXYZ

Sample Output 3

NOPQRSTUVWXYZABCDEFGHIJKLM

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include <stdio.h>

char s[10001], a[100], x;

int main()
{	 
	int n, i;
		
	scanf("%d", &n);
	x = 65 + (n < 26 ? n : 0);
	for(i = 65; i < 91; i++, x++){
		if(x == 91) x = 65;
		a[i] = x;
	}
	scanf("%s", s);
	for(i = 0; s[i]; i++) putchar(a[s[i]]);
	puts("");
		
	return 0;
}