Description

Since the EECS was leaked by an impostor among the elephants, they decided to reinforce the rule by adding one more step.

The rules of EECS-2 are as follows:

• Shift each character in the string s by k positions in the alphabetical order. For example, 
  Shifting 'a' by 3 positions results in 'd'.
  Shifting 'w' by 6 positions results in 'c'.
• Convert every character in the new string from lowercase to uppercase. For example,
  'g' becomes 'G'.

• Reverse the entire string. For example,
  "ELEPHANT" becomes "TNAHPELE".

To prove that you are not the impostor, please encrypt the string of length 5 and a shift distance k using EECS-2.

You can try solving the problem without needing to know the exact ASCII values of the letters.

 

Input

The first line contains a single integer k.

1 ≤ k ≤ 26

The second line contains a single string s.

It is guaranteed that all characters in s are lowercase letters and the length of the string is 5.

Output

Output the encrypted string.

Note that you do NOT need to print '\n' at the end of the output.

Sample Input  Download

Sample Output  Download

Tags

Discuss