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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;

class Solver
{
    string s;
    int n;

    public Solver Scan()
    {
        n = int.Parse(Console.ReadLine());
        s = Console.ReadLine();

        return this;
    }

    public void Solve()
    {
        var sb = new System.Text.StringBuilder();
        foreach(var x in s) {
            sb.Append(CalcChar(x));
        }
        Console.WriteLine(sb.ToString());
    }

    char CalcChar(char c)
    {
        return c + n <= 'Z' ? (char)(c + n) : (char)(c + n - ('Z' - 'A' + 1));
    }
}

class Program
{
    static void Main(string[] args)
    {
        new Solver().Scan().Solve();
    }
}