#include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i, j) for (int i = 0; i < (int)j; ++i) #define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i) #define SORT(v) sort(v.begin(), v.end()) #define REVERSE(v) reverse(v.begin(), v.end()) typedef complex P; typedef vector VI; typedef long long LL; typedef pair PII; int main() { cin.tie(0); ios::sync_with_stdio(false); string s; cin >> s; REP(i,s.length()) { int d = i + 1; s[i] -= d % ('Z' - 'A' + 1); if (s[i] < 'A') s[i] += ('Z' - 'A' + 1); } cout << s << endl; return 0; }