#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const long long MOD = 1000000007;
const double PI = acos(-1.);
const double eps = 1e-9;
long long modPow(long long a, long long b, long long MOD) {
  long long ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
  }
  return ret;
}
const int MXN = 1000005;
char s[MXN];
void solve() {
  while (~scanf("%s", s)) {
    int len = strlen(s);
    int flag = 0;
    for (int i = (0); i < (int)(len); i++) {
      int p = s[i] - 'a';
      int q = (p + 25) % 26;
      if (q < p) {
        s[i] = 'a' + q;
        flag = 1;
      } else {
        if (flag) break;
      }
    }
    if (!flag) {
      int p = s[len - 1] - 'a';
      int q = (p + 25) % 26;
      s[len - 1] = 'a' + q;
    }
    printf("%s\n", s);
  }
}
int main() {
  int _T = 1;
  for (int CA = (0); CA < (int)(_T); CA++) {
    solve();
  }
  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>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const long long MOD = 1000000007;
const double PI = acos(-1.);
const double eps = 1e-9;
long long modPow(long long a, long long b, long long MOD) {
  long long ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
  }
  return ret;
}
const int MXN = 1000005;
char s[MXN];
void solve() {
  while (~scanf("%s", s)) {
    int len = strlen(s);
    int flag = 0;
    for (int i = (0); i < (int)(len); i++) {
      int p = s[i] - 'a';
      int q = (p + 25) % 26;
      if (q < p) {
        s[i] = 'a' + q;
        flag = 1;
      } else {
        if (flag) break;
      }
    }
    if (!flag) {
      int p = s[len - 1] - 'a';
      int q = (p + 25) % 26;
      s[len - 1] = 'a' + q;
    }
    printf("%s\n", s);
  }
}
int main() {
  int _T = 1;
  for (int CA = (0); CA < (int)(_T); CA++) {
    solve();
  }
  return 0;
}

```