#include <bits/stdc++.h>
using namespace std;
void rc(char &a) {
  a = 0;
  register int x = getchar_unlocked();
  while (x < 'a' || x > 'z') {
    if (x == '\n') {
      a = '0';
      return;
    }
    x = getchar_unlocked();
  }
  a = x;
}
const int maxn = 100100;
int key;
int main() {
  ios_base::sync_with_stdio(0);
  string ans = "";
  char cur;
  while (true) {
    rc(cur);
    if (cur == '0') break;
    if (cur == 'a') {
      if (key == 0)
        ans += "a";
      else if (key == 1) {
        ans += "a";
        key = 2;
      } else {
        ans += "a";
      }
    } else {
      if (key == 1)
        ans += (cur - 1);
      else if (key == 0) {
        ans += (cur - 1);
        key = 1;
      } else {
        ans += cur;
      }
    }
  }
  if (key == 0) {
    ans = ans.substr(0, ans.size() - 1) + "z";
    cout << ans << '\n';
    return 0;
  }
  cout << ans << '\n';
}

### 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;
void rc(char &a) {
  a = 0;
  register int x = getchar_unlocked();
  while (x < 'a' || x > 'z') {
    if (x == '\n') {
      a = '0';
      return;
    }
    x = getchar_unlocked();
  }
  a = x;
}
const int maxn = 100100;
int key;
int main() {
  ios_base::sync_with_stdio(0);
  string ans = "";
  char cur;
  while (true) {
    rc(cur);
    if (cur == '0') break;
    if (cur == 'a') {
      if (key == 0)
        ans += "a";
      else if (key == 1) {
        ans += "a";
        key = 2;
      } else {
        ans += "a";
      }
    } else {
      if (key == 1)
        ans += (cur - 1);
      else if (key == 0) {
        ans += (cur - 1);
        key = 1;
      } else {
        ans += cur;
      }
    }
  }
  if (key == 0) {
    ans = ans.substr(0, ans.size() - 1) + "z";
    cout << ans << '\n';
    return 0;
  }
  cout << ans << '\n';
}

```