#include <bits/stdc++.h>
using namespace std;
static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
static const long long MOD = 1000000007;
template <class T>
void DEBUGA(T arr[], T n) {
  for (int i = 0; i < (n); i++) cout << arr[i] << " ";
  cout << "\n";
}
void solve() {
  string S, ans;
  cin >> (S);
  int i = 0;
  while (i < S.length()) {
    if (S[i] != 'a') break;
    if (i == S.length() - 1)
      ans += 'z';
    else
      ans += 'a';
    i++;
  }
  while (i < S.length()) {
    if (S[i] == 'a')
      break;
    else
      ans += S[i] - 1;
    i++;
  }
  while (i < S.length()) ans += S[i++];
  cout << (ans) << "\n";
}
int main() {
  solve();
  return 0;
}

### Prompt

Your challenge is to write a CPP solution to the following problem:

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;
static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
static const long long MOD = 1000000007;
template <class T>
void DEBUGA(T arr[], T n) {
  for (int i = 0; i < (n); i++) cout << arr[i] << " ";
  cout << "\n";
}
void solve() {
  string S, ans;
  cin >> (S);
  int i = 0;
  while (i < S.length()) {
    if (S[i] != 'a') break;
    if (i == S.length() - 1)
      ans += 'z';
    else
      ans += 'a';
    i++;
  }
  while (i < S.length()) {
    if (S[i] == 'a')
      break;
    else
      ans += S[i] - 1;
    i++;
  }
  while (i < S.length()) ans += S[i++];
  cout << (ans) << "\n";
}
int main() {
  solve();
  return 0;
}

```