#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  int cnt = 0, max = 0, len = 0, idx;
  cin >> s;
  int l = strlen(&s[0]);
  for (int i = 0; i < l; i++) {
    if (s[i] == 'a' && cnt > 0)
      break;
    else {
      if (s[i] == 'b')
        s[i] = 'a', cnt++;
      else if (s[i] == 'c')
        s[i] = 'b', cnt++;
      else if (s[i] == 'd')
        s[i] = 'c', cnt++;
      else if (s[i] == 'e')
        s[i] = 'd', cnt++;
      else if (s[i] == 'f')
        s[i] = 'e', cnt++;
      else if (s[i] == 'g')
        s[i] = 'f', cnt++;
      else if (s[i] == 'h')
        s[i] = 'g', cnt++;
      else if (s[i] == 'i')
        s[i] = 'h', cnt++;
      else if (s[i] == 'j')
        s[i] = 'i', cnt++;
      else if (s[i] == 'k')
        s[i] = 'j', cnt++;
      else if (s[i] == 'l')
        s[i] = 'k', cnt++;
      else if (s[i] == 'm')
        s[i] = 'l', cnt++;
      else if (s[i] == 'n')
        s[i] = 'm', cnt++;
      else if (s[i] == 'o')
        s[i] = 'n', cnt++;
      else if (s[i] == 'p')
        s[i] = 'o', cnt++;
      else if (s[i] == 'q')
        s[i] = 'p', cnt++;
      else if (s[i] == 'r')
        s[i] = 'q', cnt++;
      else if (s[i] == 's')
        s[i] = 'r', cnt++;
      else if (s[i] == 't')
        s[i] = 's', cnt++;
      else if (s[i] == 'u')
        s[i] = 't', cnt++;
      else if (s[i] == 'v')
        s[i] = 'u', cnt++;
      else if (s[i] == 'w')
        s[i] = 'v', cnt++;
      else if (s[i] == 'x')
        s[i] = 'w', cnt++;
      else if (s[i] == 'y')
        s[i] = 'x', cnt++;
      else if (s[i] == 'z')
        s[i] = 'y', cnt++;
    }
  }
  if (cnt > 0)
    cout << s;
  else {
    s[l - 1] = 'z';
    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() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  int cnt = 0, max = 0, len = 0, idx;
  cin >> s;
  int l = strlen(&s[0]);
  for (int i = 0; i < l; i++) {
    if (s[i] == 'a' && cnt > 0)
      break;
    else {
      if (s[i] == 'b')
        s[i] = 'a', cnt++;
      else if (s[i] == 'c')
        s[i] = 'b', cnt++;
      else if (s[i] == 'd')
        s[i] = 'c', cnt++;
      else if (s[i] == 'e')
        s[i] = 'd', cnt++;
      else if (s[i] == 'f')
        s[i] = 'e', cnt++;
      else if (s[i] == 'g')
        s[i] = 'f', cnt++;
      else if (s[i] == 'h')
        s[i] = 'g', cnt++;
      else if (s[i] == 'i')
        s[i] = 'h', cnt++;
      else if (s[i] == 'j')
        s[i] = 'i', cnt++;
      else if (s[i] == 'k')
        s[i] = 'j', cnt++;
      else if (s[i] == 'l')
        s[i] = 'k', cnt++;
      else if (s[i] == 'm')
        s[i] = 'l', cnt++;
      else if (s[i] == 'n')
        s[i] = 'm', cnt++;
      else if (s[i] == 'o')
        s[i] = 'n', cnt++;
      else if (s[i] == 'p')
        s[i] = 'o', cnt++;
      else if (s[i] == 'q')
        s[i] = 'p', cnt++;
      else if (s[i] == 'r')
        s[i] = 'q', cnt++;
      else if (s[i] == 's')
        s[i] = 'r', cnt++;
      else if (s[i] == 't')
        s[i] = 's', cnt++;
      else if (s[i] == 'u')
        s[i] = 't', cnt++;
      else if (s[i] == 'v')
        s[i] = 'u', cnt++;
      else if (s[i] == 'w')
        s[i] = 'v', cnt++;
      else if (s[i] == 'x')
        s[i] = 'w', cnt++;
      else if (s[i] == 'y')
        s[i] = 'x', cnt++;
      else if (s[i] == 'z')
        s[i] = 'y', cnt++;
    }
  }
  if (cnt > 0)
    cout << s;
  else {
    s[l - 1] = 'z';
    cout << s;
  }
}

```