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 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(void)
{
    char a[15000];
    char b;
    int i, n, size;
    scanf("%d", &n);
    for (i = 0; i < 15000; i++)
    {
        scanf("%c", &b);
        if (i == 0)
            continue;

        if ((b == EOF) || (b == '\n'))
            break;
        a[i - 1] = b;
    }
    size = i - 1;
    char *c;
    c = (char *)malloc((size) * sizeof(char));
    for (i = 0; i < size; i++)
    {
        c[i] = ((a[i] + n) <= 90) ? a[i] + n : a[i] + n - 26;
    }

    printf("%s\n", c);
    return 0;
}