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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::BufRead;
use std::io::BufReader;

fn main() {
    let mut buf = BufReader::new(std::io::stdin());

    let mut n = String::new();
    let mut s = String::new();
    buf.read_line(&mut n).unwrap();
    buf.read_line(&mut s).unwrap();
    let n = n.trim().parse::<u8>().unwrap();

    let a = 0x41;
    let z = 0x5a;

    let ans: String = s.trim().chars().map(|ch| {
        let ascii = ch as u8;
        if ascii + n > z {
            (ascii + n - z + a - 1) as char
        } else {
            (ascii + n) as char
        }
    }).collect();

    println!("{}", ans);
}