#include <bits/stdc++.h>
using namespace std;
const long long dx[] = {-2, -1, 1, 2, -2, 1, -1, 2};
const long long dy[] = {-1, -2, 2, 1, 1, -2, 2, -1};
const long long Mod = 1e9 + 7;
const long long N = 5e5;
const long long inf = 1e9 + 1;
const long long N_N = 1e2;
string s;
int l;
bool c;
int main() {
  cin >> s;
  string q = s;
  for (int i = 0; i < (int)s.size(); ++i)
    if (s[i] != 'a') {
      l = i;
      break;
    }
  for (int i = l; i < (int)s.size(); ++i) {
    if (s[i] == 'a') break;
    --s[i];
  }
  if (q == s) {
    if (s[(int)s.size() - 1] != 'a')
      --s[(int)s.size() - 1];
    else
      s[(int)s.size() - 1] = 'z';
  }
  cout << s;
  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;
const long long dx[] = {-2, -1, 1, 2, -2, 1, -1, 2};
const long long dy[] = {-1, -2, 2, 1, 1, -2, 2, -1};
const long long Mod = 1e9 + 7;
const long long N = 5e5;
const long long inf = 1e9 + 1;
const long long N_N = 1e2;
string s;
int l;
bool c;
int main() {
  cin >> s;
  string q = s;
  for (int i = 0; i < (int)s.size(); ++i)
    if (s[i] != 'a') {
      l = i;
      break;
    }
  for (int i = l; i < (int)s.size(); ++i) {
    if (s[i] == 'a') break;
    --s[i];
  }
  if (q == s) {
    if (s[(int)s.size() - 1] != 'a')
      --s[(int)s.size() - 1];
    else
      s[(int)s.size() - 1] = 'z';
  }
  cout << s;
  return 0;
}

```