#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
char s[maxn];
int n;
void convert(int x, int y) {
  for (int i = x; i < y; i++) {
    if (s[i] == 'a')
      s[i] = 'z';
    else
      s[i]--;
  }
}
int main() {
  while (~scanf("%s", s)) {
    n = strlen(s);
    bool ok = 0;
    int ss = 0x7f7f7f, tt = n;
    for (int i = 0; i < (n); i++) {
      if (s[i] != 'a') {
        ss = i;
        break;
      }
    }
    for (int i = ss + 1; i < n; i++) {
      if (s[i] == 'a') {
        tt = i;
        break;
      }
    }
    if (ss == 0x7f7f7f) {
      s[n - 1] = 'z';
    } else {
      convert(ss, tt);
    }
    printf("%s\n", s);
  }
  return 0;
}

### Prompt

Develop a solution in cpp 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;
const int maxn = 100100;
char s[maxn];
int n;
void convert(int x, int y) {
  for (int i = x; i < y; i++) {
    if (s[i] == 'a')
      s[i] = 'z';
    else
      s[i]--;
  }
}
int main() {
  while (~scanf("%s", s)) {
    n = strlen(s);
    bool ok = 0;
    int ss = 0x7f7f7f, tt = n;
    for (int i = 0; i < (n); i++) {
      if (s[i] != 'a') {
        ss = i;
        break;
      }
    }
    for (int i = ss + 1; i < n; i++) {
      if (s[i] == 'a') {
        tt = i;
        break;
      }
    }
    if (ss == 0x7f7f7f) {
      s[n - 1] = 'z';
    } else {
      convert(ss, tt);
    }
    printf("%s\n", s);
  }
  return 0;
}

```