#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long e) {
  long long p = 1;
  while (e > 0) {
    if (e & 1) p = (p * b) % 1000000007;
    e = e >> 1;
    b = (b * b) % 1000000007;
  }
  return p;
}
char s[100005];
int main() {
  long long n, m = 0, ans = 0, i, j, k, l, r, q, sum = 0, t;
  {
    scanf("%s", s);
    n = strlen(s);
    for (i = 0; s[i] == 'a' && i < n; i++)
      ;
    if (i == n) {
      s[n - 1] = 'z';
      printf("%s\n", s);
      return 0;
    }
    for (j = i; j < n && s[j] != 'a'; j++)
      ;
    for (k = i; k < j; k++) {
      s[k]--;
    }
    printf("%s\n", s);
  }
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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;
long long power(long long b, long long e) {
  long long p = 1;
  while (e > 0) {
    if (e & 1) p = (p * b) % 1000000007;
    e = e >> 1;
    b = (b * b) % 1000000007;
  }
  return p;
}
char s[100005];
int main() {
  long long n, m = 0, ans = 0, i, j, k, l, r, q, sum = 0, t;
  {
    scanf("%s", s);
    n = strlen(s);
    for (i = 0; s[i] == 'a' && i < n; i++)
      ;
    if (i == n) {
      s[n - 1] = 'z';
      printf("%s\n", s);
      return 0;
    }
    for (j = i; j < n && s[j] != 'a'; j++)
      ;
    for (k = i; k < j; k++) {
      s[k]--;
    }
    printf("%s\n", s);
  }
  return 0;
}

```