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: Accepted)

#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); ++i)
#define repk(i,k, n) for (ll i = k; i < (int)(n); ++i)
#define MAX 5000010
#define MOD 1000000007
typedef long long  ll;

using namespace std;

ll sum,cnt;
ll N;


int main() {
	int N;
	cin >> N;
	string s;
	cin >> s;

	rep(i, s.size()) {
		//cout <<"s[i]: " <<s[i] << endl;
		rep(j, N) {
			if (s[i] == 'Z') {
				s[i] = 'A';
			}
			else {
				//cout << s[i] << endl;
				s[i]++;
			}
		}
	}


	cout << s << endl;

	return 0;
}