#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  int counter = 0;
  int changed = 0;
  bool goIn = true;
  int a = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'a') a++;
  }
  if (a == s.size()) {
    s[s.size() - 1] = 'z';
    cout << s;
    goIn = false;
  }
  if (goIn) {
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == 'a' && s.size() > 1) {
        switch (changed) {
          case 0:
            counter++;
            changed = 1;
            break;
          case 2:
            counter = 2;
        }
      } else if (s[i] != 'a' && counter != 0) {
        s[i]--;
        changed = 2;
      } else if (s[i] != 'a' && counter == 0) {
        s[i]--;
        counter++;
        changed = 2;
      }
      if (counter == 2) break;
    }
  }
  if (goIn) {
    cout << s;
  }
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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() {
  string s;
  cin >> s;
  int counter = 0;
  int changed = 0;
  bool goIn = true;
  int a = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'a') a++;
  }
  if (a == s.size()) {
    s[s.size() - 1] = 'z';
    cout << s;
    goIn = false;
  }
  if (goIn) {
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == 'a' && s.size() > 1) {
        switch (changed) {
          case 0:
            counter++;
            changed = 1;
            break;
          case 2:
            counter = 2;
        }
      } else if (s[i] != 'a' && counter != 0) {
        s[i]--;
        changed = 2;
      } else if (s[i] != 'a' && counter == 0) {
        s[i]--;
        counter++;
        changed = 2;
      }
      if (counter == 2) break;
    }
  }
  if (goIn) {
    cout << s;
  }
}

```