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: Wrong Answer)

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

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

main()