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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

module Main where

import           Data.Char
import           Data.Maybe                     ( fromJust )
import qualified Data.ByteString.Char8         as BS


bytestr2Int = fst . fromJust . BS.readInt
getInt = bytestr2Int <$> BS.getLine
getIntLH = map bytestr2Int . BS.words <$> BS.getLine
getIntLV n = replicate n $ getInt
getInt2D n = replicate n $ getIntLH


main :: IO ()
main = do
    n  <- getInt
    ss <- getLine
    putStrLn $ map (shift n) ss

shift :: Int -> Char -> Char
shift n c = toEnum $ if r < 91 then r else r - 26 where r = (+ n) $ ord c