#include <bits/stdc++.h>
using namespace std;
int ra() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int main() {
  string ch;
  cin >> ch;
  string old = ch;
  for (int i = 0; i < ch.size(); i++)
    if (ch[i] != 'a') {
      for (int j = i; j < ch.size(); j++) {
        if (ch[j] == 'a')
          break;
        else
          ch[j] = ch[j] - 1;
      }
      break;
    }
  if (ch == old) ch[old.size() - 1] = 'z';
  cout << ch;
  return 0;
}

### Prompt

Your challenge is to write 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;
int ra() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int main() {
  string ch;
  cin >> ch;
  string old = ch;
  for (int i = 0; i < ch.size(); i++)
    if (ch[i] != 'a') {
      for (int j = i; j < ch.size(); j++) {
        if (ch[j] == 'a')
          break;
        else
          ch[j] = ch[j] - 1;
      }
      break;
    }
  if (ch == old) ch[old.size() - 1] = 'z';
  cout << ch;
  return 0;
}

```