#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
  int f = -1, l = -1, len;
  getline(cin, str);
  str.insert(0, "a");
  str.push_back('a');
  len = str.size() - 1;
  for (int i = 1; i < len; i++) {
    if (str[i] != 'a' & str[i - 1] == 'a')
      if (f == -1) f = i;
    if (str[i] != 'a' & str[i + 1] == 'a')
      if (l == -1) l = i;
  }
  if (l + f > 0)
    for (int i = f; i <= l; i++) str[i] = str[i] - 1;
  else
    str[len - 1] = 'z';
  str.erase(0, 1);
  str.erase(len - 1, len - 1);
  cout << str << "\n";
  return 0;
}

### 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;
string str;
int main() {
  int f = -1, l = -1, len;
  getline(cin, str);
  str.insert(0, "a");
  str.push_back('a');
  len = str.size() - 1;
  for (int i = 1; i < len; i++) {
    if (str[i] != 'a' & str[i - 1] == 'a')
      if (f == -1) f = i;
    if (str[i] != 'a' & str[i + 1] == 'a')
      if (l == -1) l = i;
  }
  if (l + f > 0)
    for (int i = f; i <= l; i++) str[i] = str[i] - 1;
  else
    str[len - 1] = 'z';
  str.erase(0, 1);
  str.erase(len - 1, len - 1);
  cout << str << "\n";
  return 0;
}

```