#include <bits/stdc++.h>
using namespace std;
int n, l = 0;
int a[100100];
char s[100100];
int fun(int x, int y) {
  for (int i = 0; i < x; i++) cout << s[i];
  for (int i = x; i <= y; i++) {
    cout << char(s[i] - 1);
  }
  for (int i = y + 1; i < n; i++) cout << s[i];
  exit(0);
}
int main() {
  cin >> s;
  n = strlen(s);
  for (int i = 0; i < n; i++) {
    if (s[i] == 'a') {
      a[l++] = i;
    }
  }
  if (l == 0) {
    fun(0, n - 1);
  }
  if (a[0] != 0) {
    fun(0, a[0] - 1);
  }
  for (int i = 1; i < l; i++) {
    if (a[i] - a[i - 1] != 1) {
      fun(a[i - 1] + 1, a[i] - 1);
    }
  }
  if (a[l - 1] != n - 1) {
    fun(a[l - 1] + 1, n - 1);
  }
  for (int i = 0; i < l - 1; i++) {
    cout << 'a';
  }
  cout << 'z';
  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;
int n, l = 0;
int a[100100];
char s[100100];
int fun(int x, int y) {
  for (int i = 0; i < x; i++) cout << s[i];
  for (int i = x; i <= y; i++) {
    cout << char(s[i] - 1);
  }
  for (int i = y + 1; i < n; i++) cout << s[i];
  exit(0);
}
int main() {
  cin >> s;
  n = strlen(s);
  for (int i = 0; i < n; i++) {
    if (s[i] == 'a') {
      a[l++] = i;
    }
  }
  if (l == 0) {
    fun(0, n - 1);
  }
  if (a[0] != 0) {
    fun(0, a[0] - 1);
  }
  for (int i = 1; i < l; i++) {
    if (a[i] - a[i - 1] != 1) {
      fun(a[i - 1] + 1, a[i] - 1);
    }
  }
  if (a[l - 1] != n - 1) {
    fun(a[l - 1] + 1, n - 1);
  }
  for (int i = 0; i < l - 1; i++) {
    cout << 'a';
  }
  cout << 'z';
  return 0;
}

```