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)

n = gets.chomp.to_i
keyword = gets.chomp.to_s

# 暗号化した文字列を格納するための配列を定義
code = []

# keyword.charsで入力された文字列を１文字ずつ分解して配列へ
keyword.chars.each do |char|
  num = (char.ord - n) # .ord で文字コードへ変換（数値化）しnつ分、シフトする
  code << num.chr # 文字コードを文字列へ戻し、配列codeに入れていく
end

# 配列codeに入った文字列を全て連結させて出力
puts "暗号化後: #{code.join("")}"