#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
using namespace std;
struct btk{btk(){ios::sync_with_stdio(false);cin.tie(0);}}btk;
int main()
{
	string S;
	cin >> S;

	const string T{"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
	vector<int> vc;
	REP( i, (int)S.size() )
	{
		vc.push_back( T.find( S[i] ) );
	}
	int N{1};
	REP( i, (int)S.size() )
	{
		cout << ( vc[i] - N < 0 ? T[ 26 - abs( vc[i] - N ) ] : T[ vc[i] - N ] );
		N++;
		if( N == 26 ) N = 0;
	}
	cout << endl;
	return 0;
}