#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 10;
char s[N];
int main() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  bool checked = false;
  int start = 1, finish = 0, mx = 0;
  for (int i = 1, j; i <= n;) {
    if (s[i] == 'a') {
      ++i;
      continue;
    }
    j = i;
    checked = true;
    while (s[j] != 'a' && j <= n) {
      ++j;
    }
    if (j - i > mx) {
      start = i;
      finish = j - 1;
      mx = finish - start + 1;
    }
    break;
    i = j;
  }
  for (int i = start; i <= finish; i++) {
    s[i] = char(s[i] - 1);
  }
  if (!checked) {
    s[n] = 'z';
  }
  printf("%s", s + 1);
  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;
const int N = (int)1e5 + 10;
char s[N];
int main() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  bool checked = false;
  int start = 1, finish = 0, mx = 0;
  for (int i = 1, j; i <= n;) {
    if (s[i] == 'a') {
      ++i;
      continue;
    }
    j = i;
    checked = true;
    while (s[j] != 'a' && j <= n) {
      ++j;
    }
    if (j - i > mx) {
      start = i;
      finish = j - 1;
      mx = finish - start + 1;
    }
    break;
    i = j;
  }
  for (int i = start; i <= finish; i++) {
    s[i] = char(s[i] - 1);
  }
  if (!checked) {
    s[n] = 'z';
  }
  printf("%s", s + 1);
  return 0;
}

```