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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;

public class Main{
    public static void main(String args[])throws Exception{
        Scanner stdin = new Scanner(System.in);

        int N = stdin.nextInt();
        String S = stdin.next();

        ArrayList<String> Sa = new ArrayList<>();

        for(int i= 0;i < S.length();i++){
            Sa.add(S.substring(i,i+1));
        }
        
        for(int i = 0;i < Sa.size();i++){
            int charValue = Sa.get(i).charAt(0);
            if(charValue+N > 90){
                int h = charValue-90;
                charValue = 65+h-1;
                String next1 = String.valueOf( (char) (charValue + N));
                Sa.set(i,next1);
            }
            else{
                String next = String.valueOf( (char) (charValue + N));
                Sa.set(i,next);
            }
        }
        for(int i=0;i < Sa.size();i++){
        System.out.printf("%s",Sa.get(i));
        }
    }
}