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

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner obj = new Scanner(System.in);
        String English="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
        char[] Arr_Eng = English.toCharArray();
        int N=obj.nextInt();
        String S=obj.next();
        char[] Arr1 = S.toCharArray();
        int[] ArrIndex = new int[S.length()];
        for (int i=0;i<S.length();i++){
            for (int j=0;j<26;j++){
                if(Arr1[i]==Arr_Eng[j])
                    ArrIndex[i]=j;
            }
        }
        int realIndex=N;
        for (int i=0;i<S.length();i++){
            int Sum=ArrIndex[i]+N;
            if (Sum>25) {
                realIndex = Sum - 26;
                ArrIndex[i] = realIndex;
            }
            else
            ArrIndex[i]+= realIndex;
        }
        for (int i=0;i<S.length();i++){
            System.out.print(Arr_Eng[ArrIndex[i]]);
        }
    }
}