#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n;
string s;
void Enter() {
  cin >> s;
  n = s.size();
  for (int i = 0; i <= n - 1; i++)
    if (s[i] != 'a') {
      int j = i;
      while (j <= n - 1 && s[j] != 'a') {
        s[j] = char(s[j] - 1);
        ++j;
      }
      cout << s;
      return;
    }
  s[n - 1] = 'z';
  cout << s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  Enter();
}

### 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;
const int N = 2e5 + 7;
int n;
string s;
void Enter() {
  cin >> s;
  n = s.size();
  for (int i = 0; i <= n - 1; i++)
    if (s[i] != 'a') {
      int j = i;
      while (j <= n - 1 && s[j] != 'a') {
        s[j] = char(s[j] - 1);
        ++j;
      }
      cout << s;
      return;
    }
  s[n - 1] = 'z';
  cout << s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  Enter();
}

```