#90Medium

Caesar cipher

Time: 1 s · Memory: 256 MB

Strings

Statement

In the Caesar cipher every Latin letter is replaced by the letter $k$ positions further in the alphabet. The alphabet wraps around: after z comes a again. Uppercase stays uppercase and lowercase stays lowercase; other characters do not change.

You are given a number $k$ and a string. Encrypt the string.

Input format

The first line contains $k$ ( $0 \le k \le 25$ ). The second line contains a string of $1$ to $1000$ ASCII characters, words separated by single spaces, with no spaces at the start or the end.

Output format

The encrypted string.

Examples

Input

3
Hello, World!

Output

Khoor, Zruog!

Input

1
xyz XYZ

Output

yza YZA

Note

The position of a letter in the alphabet is $c -$ 'a' (or 'A'): add $k$ , take the remainder modulo $26$ and add 'a' back. In the first example: Khoor, Zruog!; in the second — yza YZA.

Caesar cipher

Time: 1 s · Memory: 256 MB

Strings

Statement

You are given a number $k$ and a string. Encrypt the string.

Input format

The first line contains $k$ ( $0 \le k \le 25$ ). The second line contains a string of $1$ to $1000$ ASCII characters, words separated by single spaces, with no spaces at the start or the end.

Output format

The encrypted string.

Examples

Input

3
Hello, World!

Output

Khoor, Zruog!

Input

1
xyz XYZ

Output

yza YZA

Note

The position of a letter in the alphabet is $c -$ 'a' (or 'A'): add $k$ , take the remainder modulo $26$ and add 'a' back. In the first example: Khoor, Zruog!; in the second — yza YZA.