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 Ruby (2.3.3) (judge verdict: Accepted)

def solve(n ,s)
    table = {"A"=> 0,"B"=> 1,"C"=>2,"D"=>3,"E"=>4,
    "F"=>5,"G"=>6,"H"=>7,"I"=>8,"J"=>9,
    "K"=>10,"L"=>11,"M"=>12,"N"=>13,"O"=>14,
    "P"=>15,"Q"=>16,"R"=>17,"S"=>18,"T"=>19,
    "U"=>20,"V"=>21,"W"=>22,"X"=>23,"Y"=>24,
    "Z"=>25}
    mapped_l = s.chars.map do |c|
        idx = (table[c] + n) % table.length
        table.keys[idx]
    end
    mapped_l.join
end

def main()
    n = gets.to_i
    s = gets.chomp
    ans = solve(n ,s)
    puts ans
end

main()