#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

int max(int a, int b) {
	int x = (a > b) ? a : b;
	return x;
}

int min(int a, int b) {
	int x = (a < b) ? a : b;
	return x;
}

int binary_search(int n, vector<int> v,int key) {
	int left=0, right=n;

	while (left < right) {
		int mid = (left + right) / 2;
		if (v[mid] == key) return mid;
		else if (v[mid] < key) {
			left = mid + 1;
		}
		else if (v[mid] > key) {
			right = mid - 1;
		}
	}
}

int main() {
	string s;
	cin >> s;
	for (int i = 0; i < s.length(); i++) {
		s[i] -= (i + 1)%26;
		if (s[i] < 'A') s[i] += 'Z' - 'A' + 1;
		cout << s[i];
	}
	cout << endl;
	return 0;
}