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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <iostream>
#include <array>
#include <string>
#include <cstring>

using namespace std;
int lenght(char* str) {
	int n = strlen(str);
	return n;
}

int main(void) {
	int N;
	char str[1000] = {};
	cin >> N >> str;
	int a = lenght(str);
	array<char, 26>alf = { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };

	for (int j = 0; j < a; j++) {
		for (int i = 0; i < 26; i++) {
			if (str[j] == alf[i] && N + i < 26) {
				str[j] = alf[i + N];
				break;
			}
			else if (str[j] == alf[i] && N + i >= 26) {
				str[j] = alf[i + N - 26];
				break;
			}
		}
	}
	cout << str << endl;
	return 0;
}