#include <bits/stdc++.h>
using namespace std;
void shift(char s[], char ans[], int start, int last) {
  int i;
  strcpy(ans, s);
  for (i = start; i <= last; i++) {
    if (s[i] == 'a') {
      ans[i] = 'z';
    } else
      ans[i] = s[i] - 1;
  }
}
int main() {
  char s[100005], m[100005], p[100005], q[100005];
  scanf("%s", s);
  int i, j, k, last = -1, start = -1, flag = 0;
  int n = strlen(s);
  for (i = 0; i < n; i++) {
    if (s[i] == 'a' && flag == 0)
      continue;
    else if (flag == 0) {
      start = i;
      flag = 1;
    }
    if (flag == 1 && (i >= n - 1)) {
      last = n - 1;
      flag = 3;
    } else if (flag == 1 && s[i + 1] == 'a') {
      last = i;
      flag = 3;
    }
    if (flag == 3) break;
  }
  strcpy(p, s);
  if (last == -1 && start == -1) {
    s[strlen(s) - 1] = 'z';
    printf("%s", s);
    return 0;
  }
  shift(s, p, start, last);
  printf("%s", p);
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;
void shift(char s[], char ans[], int start, int last) {
  int i;
  strcpy(ans, s);
  for (i = start; i <= last; i++) {
    if (s[i] == 'a') {
      ans[i] = 'z';
    } else
      ans[i] = s[i] - 1;
  }
}
int main() {
  char s[100005], m[100005], p[100005], q[100005];
  scanf("%s", s);
  int i, j, k, last = -1, start = -1, flag = 0;
  int n = strlen(s);
  for (i = 0; i < n; i++) {
    if (s[i] == 'a' && flag == 0)
      continue;
    else if (flag == 0) {
      start = i;
      flag = 1;
    }
    if (flag == 1 && (i >= n - 1)) {
      last = n - 1;
      flag = 3;
    } else if (flag == 1 && s[i + 1] == 'a') {
      last = i;
      flag = 3;
    }
    if (flag == 3) break;
  }
  strcpy(p, s);
  if (last == -1 && start == -1) {
    s[strlen(s) - 1] = 'z';
    printf("%s", s);
    return 0;
  }
  shift(s, p, start, last);
  printf("%s", p);
  return 0;
}

```