CACI - Caesar cipher

no tags 

In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions up/down the alphabet. The method is named after Julius Caesar, who used it in his private correspondence.

The encryption can also be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A = 0, B = 1 ... Z = 25. Encryption of a letter by a shift n can be described mathematically as: E(x) = (x + n) mod 26.

Input

The input starts with a string and continues until newline. The string is uppercase and at most 100 characters long.

Output

For each test case print the result of the encryption for n is 3.

Example

Input:
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG

Output:
WKH TXLFN EURZQ IRA MXPSV RYHU WKH ODCB GRJ

Problem setter: Sabiha Firdaus, Lecturer Department of CSE, Bangladesh University of Business and Technology (BUBT)


hide comments
nadstratosfer: 2018-09-25 22:07:24

Read cases until EOF. n is always 3.
[Simes]: added

Last edit: 2023-04-28 20:20:05

Added by:Alim
Date:2015-09-09
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY