#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string cad;
  cin >> cad;
  string res = "";
  int cd = 0;
  for (int i = 0; i < cad.size(); ++i) {
    if (cad[i] != 'a' && (cd == 0 || cd == 2)) {
      char x = (cad[i] - 1);
      cout << x;
      cd = 2;
    } else {
      if (cd != 0) cd = 1;
      if (i == cad.size() - 1 && cd == 0)
        cout << 'z' << endl;
      else
        cout << cad[i];
    }
  }
  return 0;
}

### Prompt

Create a solution in cpp for 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;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string cad;
  cin >> cad;
  string res = "";
  int cd = 0;
  for (int i = 0; i < cad.size(); ++i) {
    if (cad[i] != 'a' && (cd == 0 || cd == 2)) {
      char x = (cad[i] - 1);
      cout << x;
      cd = 2;
    } else {
      if (cd != 0) cd = 1;
      if (i == cad.size() - 1 && cd == 0)
        cout << 'z' << endl;
      else
        cout << cad[i];
    }
  }
  return 0;
}

```