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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace RotN
{
	class Program
	{
		static void Main(string[] args)
		{
			int n = Convert.ToInt16(Console.ReadLine());
			string s = Console.ReadLine();

			string alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
			for (int i=0;i<s.Length;i++)
			{
				int j = 0;
				bool sameflg = false;
				int count = n;

				while (true)
				{
					if (j >= alphabet.Length)
					{
						j = 0;
					}
					if (count==0)
					{
						break;
					}
					if (sameflg)
					{
						count--;
					}
					if (alphabet[j]==s[i])
					{
						sameflg = true;
						
					}

					j++;
				}

				s = s.Replace(s[i], alphabet[j]);
			}
			Console.WriteLine(s);
			Console.ReadKey(true);

		}
	}
}