#include <bits/stdc++.h>
using namespace std;
const int Max = 100005;
char str[Max];
int main() {
  while (scanf("%s", str) != EOF) {
    int len = strlen(str), flag = 0, i, label = 0;
    for (i = 0; i < len - 1; i++) {
      if (!flag && str[i] == 'a')
        printf("%c", str[i]);
      else if (str[i] - 1 >= 'a') {
        printf("%c", str[i] - 1);
        flag = 1;
      } else if (flag && str[i] == 'a') {
        label = 1;
        break;
      } else if (flag && (str[i] - 1) >= 'a')
        printf("%c", str[i] - 1);
    }
    if (label)
      for (int j = i; j < len; j++) {
        printf("%c", str[j]);
      }
    else if (!flag && str[len - 1] == 'a')
      printf("z\n");
    else if (!flag && (str[len - 1] - 1) >= 'a')
      printf("%c\n", str[len - 1] - 1);
    else if (flag && str[len - 1] == 'a')
      printf("a\n");
    else if (flag && (str[len - 1] - 1) >= 'a')
      printf("%c", str[len - 1] - 1);
  }
  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;
const int Max = 100005;
char str[Max];
int main() {
  while (scanf("%s", str) != EOF) {
    int len = strlen(str), flag = 0, i, label = 0;
    for (i = 0; i < len - 1; i++) {
      if (!flag && str[i] == 'a')
        printf("%c", str[i]);
      else if (str[i] - 1 >= 'a') {
        printf("%c", str[i] - 1);
        flag = 1;
      } else if (flag && str[i] == 'a') {
        label = 1;
        break;
      } else if (flag && (str[i] - 1) >= 'a')
        printf("%c", str[i] - 1);
    }
    if (label)
      for (int j = i; j < len; j++) {
        printf("%c", str[j]);
      }
    else if (!flag && str[len - 1] == 'a')
      printf("z\n");
    else if (!flag && (str[len - 1] - 1) >= 'a')
      printf("%c\n", str[len - 1] - 1);
    else if (flag && str[len - 1] == 'a')
      printf("a\n");
    else if (flag && (str[len - 1] - 1) >= 'a')
      printf("%c", str[len - 1] - 1);
  }
  return 0;
}

```