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) {
    Scanner sc = new Scanner(System.in);
    List<String> words;
    words=new ArrayList<>(Arrays.asList("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"));
    int num = Integer.parseInt(sc.next());
    String line = sc.next();
    for(int i = 0; i < line.length(); i++){
      String word = line.substring(i,i+1);
      if(words.indexOf(word)+num > 25){
        System.out.print(words.get(words.indexOf(word)+num-26));
      }else{
        System.out.print(words.get(words.indexOf(word)+num));
      }
    }
    System.out.println();
  }
}