#include <bits/stdc++.h>
using namespace std;
char next_el(char a) {
  if (a == 'a') return 'z';
  return char(int(a) - 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, p;
  string s, t;
  char e;
  cin >> s;
  p = 0;
  for (i = 0; i < s.size(); i++) {
    if (p == 0) {
      if (s[i] != 'a') p = 1;
    }
    if (p == 1) {
      if (s[i] != 'a')
        s[i] = next_el(s[i]);
      else
        break;
    }
  }
  if (p == 0) s[s.size() - 1] = next_el(s[s.size() - 1]);
  cout << s;
  return 0;
}

### Prompt

In cpp, your task is to solve 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 next_el(char a) {
  if (a == 'a') return 'z';
  return char(int(a) - 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, p;
  string s, t;
  char e;
  cin >> s;
  p = 0;
  for (i = 0; i < s.size(); i++) {
    if (p == 0) {
      if (s[i] != 'a') p = 1;
    }
    if (p == 1) {
      if (s[i] != 'a')
        s[i] = next_el(s[i]);
      else
        break;
    }
  }
  if (p == 0) s[s.size() - 1] = next_el(s[s.size() - 1]);
  cout << s;
  return 0;
}

```