#include<bits/stdc++.h>
using namespace std;
const int in=1e5+10;
const int inf=0x3f3f3f3f;
#define LL long long
LL n,x,y;
double p;
string a;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	getline(cin,a);               
	for(int i=0;i<a.size();i++)
	{
		if(a[i]>='A'&&a[i]<='Z')
		{
			a[i]+=3;
			if(a[i]>90)
			a[i]-=26;
		}
		if(a[i]>='a'&&a[i]<='z')
		{
			a[i]+=3;
			if(a[i]>122)
			a[i]-=26;
		}
	}	
	reverse(&a[0],&a[a.size()]);		
	for(int j=0;j<a.size();j++)
	{
		if((a[j]>='a'&&a[j]<='z')||(a[j]>='A'&&a[j]<='Z'))
		{
			if(a[j]>='a'&&a[j]<='z')a[j]-=32;
			else a[j]+=32;
		}
						
	}						
	cout<<a;
	return 0;
}

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
	string a;
	cin>>a;
	int l=a.size();
	for(int i=0;i<l;i++){
		a[i]=a[i]+3;
		if((a[i]>'Z' && a[i]<'a') || a[i]>'z'){
			a[i]=a[i]-26;			
		}		
	}	
	reverse(&a[0],&a[l]);
	for(int i=0;i<l;i++){
		if(a[i]>='A' && a[i]<='Z'){
			a[i]=a[i]+32;
		}else{
			a[i]=a[i]-32;
		}
	}
	cout<<a;
	return 0;
}

#include<queue>
#include<math.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<iomanip>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<stack>
#include<fstream>
#include<string>
using namespace std;
const int N=50+10;//1表示开头为1,2表示10的2次方
const int INT=0x3f3f3f3f;//INT+INT int范围内最大INT*INT ,long long;
char s[N];
int main ( ) {
    cin.getline(s,N);
    int len=strlen(s);
    for(int i=0;i<len;i++){
        if(s[i]+3>122)s[i]=s[i]+3-26-32;
        else if(s[i]+3>90&&s[i]+3<97)s[i]=s[i]+3-26+32;
        else if(s[i]<='Z'&&s[i]>='A')s[i]+=32+3;
        else if(s[i]>='a'&&s[i]<='z')s[i]-=32-3;
    }
    for(int i=len-1;i>=0;i--){
        cout<<s[i];
    }
}
//防伪zzc~