#include <bits/stdc++.h>
using namespace std;
char s[7239487];
int i, j, k, len;
int main() {
  scanf("%s", s);
  len = strlen(s);
  for (k = 0; k < len; k++)
    if (s[k] != 'a') break;
  for (j = k; j < len; j++)
    if (s[j] == 'a') break;
  for (i = k; i < j; i++) s[i] = s[i] - 1;
  if (k == len) s[len - 1] = 'z';
  for (k = 0; k < len; k++) putchar(s[k]);
  putchar('\n');
  return 0;
}

### Prompt

Your task is to create 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;
char s[7239487];
int i, j, k, len;
int main() {
  scanf("%s", s);
  len = strlen(s);
  for (k = 0; k < len; k++)
    if (s[k] != 'a') break;
  for (j = k; j < len; j++)
    if (s[j] == 'a') break;
  for (i = k; i < j; i++) s[i] = s[i] - 1;
  if (k == len) s[len - 1] = 'z';
  for (k = 0; k < len; k++) putchar(s[k]);
  putchar('\n');
  return 0;
}

```