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.42.0) (judge verdict: Accepted)

use std::io;
use std::io::{stdin, Read};
use std::process::exit;
use std::cmp::min;

fn main() {

    let mut scan = stdin();
    let mut line = String::new();

    let _ = scan.read_line(&mut line);
    let _ = scan.read_line(&mut line);
    let inputs: Vec<&str> = line.split_whitespace().collect();

    let n: i32 = inputs[0].parse().unwrap();
    let s: String = inputs[1].to_string();

    let char_set = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"];

    for i in s.as_str().chars(){
        let char_number = str2i(i);
        let index = (char_number + n) % 26;
        print!("{}", char_set[index as usize]);
    }
}

fn str2i(c: char) -> i32 {
    let char_set = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"];
    let mut position: i32 = 0;

    for i in char_set.iter(){
        let ch = i;
        if c == ch.parse().unwrap() {
            return position;
        }
        position += 1;
    }
    return 0;
}