#include <bits/stdc++.h>
using namespace std;
vector<int> v(1000001);
int main() {
  string s;
  cin >> s;
  bool allAs = true;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] != 'a') {
      v[i] = 1;
      allAs = false;
    }
  }
  bool inSwapArea = false, firstOne = false, weHaveAnswered = false;
  for (int i = 0; i < s.size(); i++) {
    if (!firstOne && v[i]) {
      firstOne = true;
      inSwapArea = true;
      weHaveAnswered = true;
    }
    if (inSwapArea && !v[i]) inSwapArea = false;
    if (inSwapArea)
      printf("%c", s[i] - 1);
    else if (!allAs)
      printf("%c", s[i]);
  }
  if (!weHaveAnswered) {
    for (int i = 0; i < s.size() - 1; i++) {
      printf("%c", s[i]);
    }
    printf("z");
  }
}

### 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;
vector<int> v(1000001);
int main() {
  string s;
  cin >> s;
  bool allAs = true;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] != 'a') {
      v[i] = 1;
      allAs = false;
    }
  }
  bool inSwapArea = false, firstOne = false, weHaveAnswered = false;
  for (int i = 0; i < s.size(); i++) {
    if (!firstOne && v[i]) {
      firstOne = true;
      inSwapArea = true;
      weHaveAnswered = true;
    }
    if (inSwapArea && !v[i]) inSwapArea = false;
    if (inSwapArea)
      printf("%c", s[i] - 1);
    else if (!allAs)
      printf("%c", s[i]);
  }
  if (!weHaveAnswered) {
    for (int i = 0; i < s.size() - 1; i++) {
      printf("%c", s[i]);
    }
    printf("z");
  }
}

```