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 Python (3.4.3) (judge verdict: Accepted)

def is_upper(c):
    return ord('A') <= ord(c) and ord(c) <= ord('Z')


def is_lower(c):
    return ord('a') <= ord(c) and ord(c) <= ord('z')


def shift(c, k):
    if is_upper(c):
        return chr((ord(c) - ord('A') + k) % 26 + ord('A'))
    elif is_lower(c):
        return chr((ord(c) - ord('a') + k) % 26 + ord('a'))
    else:
        return c


def caesar(s, k, decode=False):
    if decode:
        k = -k
    return "".join([shift(c, k) for c in s])


N = int(input())
S = str(input())
enc = caesar(S, N)
print(enc)