Caesar shift cipher
What is the Caesar shift cipher (ROT$n$)? It's basically a cipher sequence that changes a letter's value from the number chosen. If we use ROT1 on "games", we get "hbnft". The basic interpretation of the cipher is iterating the value of a letter by 1 $n$ times. If you still don't understand, try using the ROT13 website.
Make a program that takes input of a number from 1 to 25, call it $n$, and takes input of a string. It could be any. Then, use $n$ to convert the string into ROT$n$ and output the result.
Examples of inputs and outputs:
If $n = 4$ and string is "Hello, world.", we get
If $n = 15$ and string is "trololol", we get
If $n = 7$ and string is "gxoxk zhggt zbox rhn ni", we get
never gonna give you up.
If $n = 24$ and string is "I want breakfast!", we get
G uylr zpcyidyqr!.
If $n = 13$ and string is "guvf grkg vf fhf", we get
this text is sus.
Shortest program wins.
[Python 3.8 (pre-release)], 98 …
[Ruby], 56 bytes -> …
[C (gcc)], 112 bytes Functi …
[C (clang)], 161 bytes …
[Haskell], 74 bytes …