String Transformation

You are given an integer (k) and a string (s) consisting only of lowercase English letters. Your task is to transform the string by shifting each character (k) positions forward in the alphabet. The transformation is cyclic, meaning that characters wrap around from 'z' to 'a'.

Constraints:
(1 \le k \le 25) and (1 \le |s| \le 1000).

For example, if (k=5) and (s=\text{'apple'}), then the output should be (\text{'fuuqj'}).

inputFormat

The input is read from standard input (stdin).

The first line contains an integer (k).
The second line contains the string (s).

outputFormat

Output the transformed string to standard output (stdout).## sample

5
apple

fuuqj