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.Scanner;

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

		int N = Integer.parseInt(sc.next());

		String s = sc.next();

		sc.close();

		String ret = "";

		for(int i = 0;i < s.length();i++) {
			char c = (char)(s.charAt(i) + N);
			if(c > 'Z') {
				c -= 26;
			}
			ret += c;
		}

		System.out.println(ret);

//		FastScanner fs = new FastScanner();
//		int N = fs.nextInt();


	}
}

//import java.io.IOException;
//import java.io.InputStream;
//import java.util.NoSuchElementException;
//
//class FastScanner {
//  private final InputStream in = System.in;
//  private final byte[] buffer = new byte[1024];
//  private int ptr = 0;
//  private int buflen = 0;
//  private boolean hasNextByte() {
//      if (ptr < buflen) {
//          return true;
//      }else{
//          ptr = 0;
//          try {
//              buflen = in.read(buffer);
//          } catch (IOException e) {
//              e.printStackTrace();
//          }
//          if (buflen <= 0) {
//              return false;
//          }
//      }
//      return true;
//  }
//  private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
//  private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
//  public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
//  public String next() {
//      if (!hasNext()) throw new NoSuchElementException();
//      StringBuilder sb = new StringBuilder();
//      int b = readByte();
//      while(isPrintableChar(b)) {
//          sb.appendCodePoint(b);
//          b = readByte();
//      }
//      return sb.toString();
//  }
//  public long nextLong() {
//      if (!hasNext()) throw new NoSuchElementException();
//      long n = 0;
//      boolean minus = false;
//      int b = readByte();
//      if (b == '-') {
//          minus = true;
//          b = readByte();
//      }
//      if (b < '0' || '9' < b) {
//          throw new NumberFormatException();
//      }
//      while(true){
//          if ('0' <= b && b <= '9') {
//              n *= 10;
//              n += b - '0';
//          }else if(b == -1 || !isPrintableChar(b)){
//              return minus ? -n : n;
//          }else{
//              throw new NumberFormatException();
//          }
//          b = readByte();
//      }
//  }
//  public int nextInt() {
//      long nl = nextLong();
//      if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
//      return (int) nl;
//  }
//  public double nextDouble() { return Double.parseDouble(next());}
//}