[5598번] 카이사르 암호

import java.math.BigInteger;
 
import java.util.Scanner;
 
 
 
public class Main {
 
    public static String palindrom(String n){
 
        BigInteger b = new BigInteger(n);
 
        String bn = b.toString();//원래수
 
        String rbn = new StringBuilder(bn).reverse().toString();//뒤집은수
 
        while(!bn.equals(rbn)){
 
            b = b.add(BigInteger.ONE);
 
            bn = b.toString();
 
            rbn = new StringBuilder(bn).reverse().toString();
 
        }
 
        return bn;
 
    }
 
    public static String caesar(String s){
 
        String result = "";
 
        for(int i=0;i<s.length();i++){
 
            char c =(char) (s.charAt(i)-3);
 
            if(c<65)
 
                c+=26;
 
            result +=c;
 
        }
 
        return result;
 
    }
 
    public static void main(String[] args) {
 
        Scanner sc = new Scanner(System.in);
 
        String m = sc.nextLine();
 
        System.out.println(caesar(m));
 
    }
 
}