The following languages are only available languages for the problems from the contest

Surprise Language Round #7:

- FALSE

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tags yet

No tag edit access

D. Caesar Cipher

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputCaesar cipher is one of the simplest encryption techniques. To transform the original message into encrypted one using key *k*, one has to replace each letter with a letter which is *k* positions later in the alphabet (if this takes the position beyond Z, the rest of it is counted from the start of the alphabet). In a more formal way, if letters of the alphabet are enumerated starting with 0, the result of encryption for character *x* will be (26 is the number of letters in the Latin alphabet).

You are given the original message and the encryption key *k*. Output the result of encryption.

Input

The first line of input contains an integer *k* (0 ≤ *k* ≤ 25) — the encryption key.

The second line contains the original message — a sequence of uppercase Latin letters ('A'-'Z'). The length of the message is from 1 to 10, inclusive.

Output

Output the result of encryption.

Examples

Input

5

CODEFORCES

Output

HTIJKTWHJX

Input

13

FALSERULEZ

Output

SNYFREHYRM

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/25/2017 18:40:59 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|