#include <bits/stdc++.h>
using namespace std;
char rev(char a) {
  if (a == 'a') return 'z';
  return (char)(a - 1);
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  int flag = 0;
  int start, end;
  for (int i = 0; i < n; i++) {
    if (flag == 0) {
      if (rev(s[i]) < s[i]) {
        flag = 1;
        start = i;
        end = i;
      }
    } else if (flag == 1) {
      if (rev(s[i]) <= s[i]) {
        end = i;
      } else {
        flag = 2;
      }
    }
  }
  if (flag == 0) {
    for (int i = 0; i < n; i++) {
      if (s[i] == rev(s[i])) {
        flag = 1;
      }
    }
    if (flag == 1)
      cout << s;
    else {
      cout << s.substr(0, s.length() - 1);
      cout << rev(s[s.length() - 1]);
    }
  } else {
    for (int i = 0; i < n; i++) {
      if (i >= start && i <= end)
        cout << rev(s[i]);
      else
        cout << s[i];
    }
  }
  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>
using namespace std;
char rev(char a) {
  if (a == 'a') return 'z';
  return (char)(a - 1);
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  int flag = 0;
  int start, end;
  for (int i = 0; i < n; i++) {
    if (flag == 0) {
      if (rev(s[i]) < s[i]) {
        flag = 1;
        start = i;
        end = i;
      }
    } else if (flag == 1) {
      if (rev(s[i]) <= s[i]) {
        end = i;
      } else {
        flag = 2;
      }
    }
  }
  if (flag == 0) {
    for (int i = 0; i < n; i++) {
      if (s[i] == rev(s[i])) {
        flag = 1;
      }
    }
    if (flag == 1)
      cout << s;
    else {
      cout << s.substr(0, s.length() - 1);
      cout << rev(s[s.length() - 1]);
    }
  } else {
    for (int i = 0; i < n; i++) {
      if (i >= start && i <= end)
        cout << rev(s[i]);
      else
        cout << s[i];
    }
  }
  return 0;
}

```