#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const int maxn = 100000;
char s[maxn + 5];
int main() {
  scanf("%s", s);
  int n = strlen(s);
  bool find = 0;
  for (int i = (0), i_end_ = (n); i < i_end_; ++i)
    if (s[i] != 'a') {
      find = 1;
      for (int j = i; j < n; ++j) {
        if (s[j] == 'a') break;
        --s[j];
      }
      break;
    }
  if (!find) s[n - 1] = 'z';
  printf("%s\n", s);
  return 0;
}

### Prompt

Your challenge is to write 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;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const int maxn = 100000;
char s[maxn + 5];
int main() {
  scanf("%s", s);
  int n = strlen(s);
  bool find = 0;
  for (int i = (0), i_end_ = (n); i < i_end_; ++i)
    if (s[i] != 'a') {
      find = 1;
      for (int j = i; j < n; ++j) {
        if (s[j] == 'a') break;
        --s[j];
      }
      break;
    }
  if (!find) s[n - 1] = 'z';
  printf("%s\n", s);
  return 0;
}

```