#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
  cin >> str;
  string temp = str;
  int i = 0;
  int notsubstring = 0;
  while (temp[i] != '\n' && i < temp.size()) {
    if (temp[i] != 'a') {
      temp[i] = temp[i] - 1;
      notsubstring = i + 1;
    }
    if (temp[i] == 'a' && (notsubstring > 0)) {
      if (i + 1 - notsubstring == 1) break;
    }
    i++;
  }
  if (notsubstring == 0) {
    if (temp[temp.size() - 1] == 'a') temp[temp.size() - 1] = 'z';
  }
  cout << temp << endl;
  return 0;
}

### Prompt

Please formulate a CPP solution to the following problem:

You are given a non-empty string s consisting of lowercase English letters. You have to pick exactly one non-empty substring of s and shift all its letters 'z' <image> 'y' <image> 'x' <image> 'b' <image> 'a' <image> 'z'. In other words, each character is replaced with the previous character of English alphabet and 'a' is replaced with 'z'.

What is the lexicographically minimum string that can be obtained from s by performing this shift exactly once?

Input

The only line of the input contains the string s (1 ≤ |s| ≤ 100 000) consisting of lowercase English letters.

Output

Print the lexicographically minimum string that can be obtained from s by shifting letters of exactly one non-empty substring.

Examples

Input

codeforces


Output

bncdenqbdr


Input

abacaba


Output

aaacaba

Note

String s is lexicographically smaller than some other string t of the same length if there exists some 1 ≤ i ≤ |s|, such that s1 = t1, s2 = t2, ..., si - 1 = ti - 1, and si < ti.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
  cin >> str;
  string temp = str;
  int i = 0;
  int notsubstring = 0;
  while (temp[i] != '\n' && i < temp.size()) {
    if (temp[i] != 'a') {
      temp[i] = temp[i] - 1;
      notsubstring = i + 1;
    }
    if (temp[i] == 'a' && (notsubstring > 0)) {
      if (i + 1 - notsubstring == 1) break;
    }
    i++;
  }
  if (notsubstring == 0) {
    if (temp[temp.size() - 1] == 'a') temp[temp.size() - 1] = 'z';
  }
  cout << temp << endl;
  return 0;
}

```