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.Collections.Generic;
using System.Linq;
using System.Numerics;
using static System.Console;
using static System.Math;

class Program
{
    static List<Edge>[] g;
    static void Main()
    {
        var s = new Dictionary<string, int> { ["SUN"] = 7, ["MON"] = 6, ["TUE"] = 5, ["WED"] = 4, ["THU"] = 3, ["FRI"] = 2, ["SAT"] = 1 };
        var N = int.Parse(ReadLine());
        var S = ReadLine();
        WriteLine(new string(S.Select(x => (char)((x - 'A' + N) % 26 + 'A')).ToArray()));
    }
    static int[] ans;
    void DFS(int v, int p, int c)
    {
        var k = 0;
        foreach (var u in g[v])
        {
            if (k == c) k++;
            if (u.to != p)
            {

                ans[u.id] = k;
                DFS(u.to, v, k);
            }
            k++;
        }
    }
}

public struct Edge
{
    public int to;
    public int clr;
    public int id;

    public Edge(int t, int c, int i)
    {
        to = t;
        clr = c;
        id = i;
    }
}