Caesar Cipher Encryption

This problem requires you to encrypt a given message using a Caesar cipher. Given an integer shift value \(k\) and a message consisting of lowercase letters, you need to shift each letter by \(k\) positions in the alphabet. The transformation is defined by the formula \(E(x) = (x + k)\, \bmod\, 26\), where \(x\) is the zero-based index of the letter in the alphabet. For instance, if \(k=3\) and the message is "hello", the encrypted message is "khoor". Note that the shifting wraps around; for example, shifting "xyz" by 1 results in "yza".

inputFormat

The input consists of two lines. The first line contains a non-negative integer \(k\) (the shift value). The second line contains a string of lowercase characters which represents the message to be encrypted.

outputFormat

Output a single line containing the encrypted message.

3
hello

khoor