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<iostream>
#include<bits/stdc++.h>
#define ll long long int
#define li long int
#define ull unsigned long long int
#define pb(k) push_back(k)
#define rep(i,n) for(int i =0;i<n;i++)
#define repk(i,k,n) for(int i =k; i<n; i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define rrepk(i,n,k) for(int i = n-1; i>=k; i--)
#define f first
#define s second
#define vi vector<int>
#define vvi vector<vector<int>>
#define tc int t;cin>>t;while(t--)
using namespace std;

void optimize()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

int main()
{
	optimize();
	int n;
	string s;
	cin>>n>>s;
	string ans;
	for(int i = 0; i<s.size(); i++)
    {
        ans+=((char)((s[i]-'A'+n)%26+'A'));
    }
    cout<<ans;
}