#include <bits/stdc++.h>
using namespace std;
int main() {
  char s[100005];
  scanf("%s", s);
  int len = strlen(s);
  int t = 0;
  if (s[0] == 'a') {
    if (len == 1) {
      cout << "z";
      return 0;
    }
    int i = 0;
    int ok = 0;
    while (s[i] == 'a') {
      cout << "a";
      i++;
      if (i == len - 1 && s[i] == 'a') {
        cout << "z";
        ok = 1;
        break;
      }
    }
    if (ok == 1) return 0;
    for (; i < len; i++) {
      if (t == 0) {
        if (s[i] == 'a') {
          printf("a");
          t = 1;
        } else
          printf("%c", s[i] - 1);
      } else
        printf("%c", s[i]);
    }
  } else {
    for (int i = 0; i < len; i++) {
      if (t == 0) {
        if (s[i] == 'a') {
          printf("a");
          t = 1;
        } else
          printf("%c", s[i] - 1);
      } else
        printf("%c", s[i]);
    }
  }
  return 0;
}

### Prompt

Please create a solution in cpp 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 main() {
  char s[100005];
  scanf("%s", s);
  int len = strlen(s);
  int t = 0;
  if (s[0] == 'a') {
    if (len == 1) {
      cout << "z";
      return 0;
    }
    int i = 0;
    int ok = 0;
    while (s[i] == 'a') {
      cout << "a";
      i++;
      if (i == len - 1 && s[i] == 'a') {
        cout << "z";
        ok = 1;
        break;
      }
    }
    if (ok == 1) return 0;
    for (; i < len; i++) {
      if (t == 0) {
        if (s[i] == 'a') {
          printf("a");
          t = 1;
        } else
          printf("%c", s[i] - 1);
      } else
        printf("%c", s[i]);
    }
  } else {
    for (int i = 0; i < len; i++) {
      if (t == 0) {
        if (s[i] == 'a') {
          printf("a");
          t = 1;
        } else
          printf("%c", s[i] - 1);
      } else
        printf("%c", s[i]);
    }
  }
  return 0;
}

```