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

### Prompt

Generate 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;
int main() {
  string s;
  cin >> s;
  int n = s.size();
  int flag = 0;
  if (s[0] == 'a') {
    for (int i = 1; i < n; i++) {
      if (s[i] != 'a' && flag == 0) flag = 1;
      if (flag == 1) {
        if (s[i] == 'a') break;
        s[i] = s[i] - 1;
      }
    }
  } else {
    for (int i = 0; i < n; i++) {
      if (s[i] == 'a') break;
      s[i] = s[i] - 1;
      flag = 1;
    }
  }
  if (flag == 0) {
    s[n - 1] = 'z';
  }
  cout << s << "\n";
  return 0;
}

```