#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
	string str;

	cin >> str;

	string ans;

	string alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

	REP(i, str.size()){
		int index = alp.find(str[i]);
		index = index - (i + 1);
		while(index < 0) index += 26;
		ans.push_back(alp[index]);
		//str.replace(i,1,alp[index],alp[index]);
	}

	cout << ans << endl;

	return 0;
}