Letter Shift

Problem Background

Corresponding multiple-choice / true-false question: https://ti.luogu.com.cn/problemset/1151

Problem Description

Xiao Yang learned the encryption technique of shifting: all uppercase letters are shifted backward by a fixed amount. The shift treats the alphabet as a ring with head and tail connected. For example, when the shift amount is $3$, the uppercase letter A is replaced by D, and Z is replaced by C. Overall, the uppercase alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ is replaced by DEFGHIJKLMNOPQRSTUVWXYZABC.

Note: when the shift amount is a multiple of $26$, each uppercase letter returns exactly to its original position after shifting, i.e. the uppercase alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ remains unchanged after the shift.

Input Format

The first line contains a positive integer $n$.

Output Format

Output the result of shifting the uppercase alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ with shift amount $n$.

Sample Input

3

Sample Output

DEFGHIJKLMNOPQRSTUVWXYZABC

Sample Explanation

When the shift amount is $3$, A is replaced by D and Z is replaced by C, so the uppercase alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ is replaced by DEFGHIJKLMNOPQRSTUVWXYZABC.

Constraints

For all test data, it is guaranteed that $1 \le n \le 100$.