#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double pi = acos(-1.0), eps = 1e-9, e = exp(1.0);
const int INF = 1000 * 1000 * 1000 + 5, MAXN = 100005, MOD = 1000000007,
          MAXBIT = 30;
const long long INFL = 1e+18;
void prepare(string s) {
  if ((int)s.size() != 0) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
string s;
void solve() {
  cin >> s;
  int ind = -1;
  for (int i = 0; i < (int)s.size(); ++i) {
    if (s[i] != 'a') {
      ind = i;
      break;
    }
  }
  if (ind == -1) {
    s[(int)s.size() - 1] = 'z';
    cout << s;
  } else {
    for (int i = ind; i < (int)s.size(); i++) {
      if (s[i] == 'a') break;
      s[i]--;
    }
    cout << s;
  }
}
int main() {
  prepare("");
  solve();
  return 0;
}

### Prompt

Your task is to create 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;
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double pi = acos(-1.0), eps = 1e-9, e = exp(1.0);
const int INF = 1000 * 1000 * 1000 + 5, MAXN = 100005, MOD = 1000000007,
          MAXBIT = 30;
const long long INFL = 1e+18;
void prepare(string s) {
  if ((int)s.size() != 0) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
string s;
void solve() {
  cin >> s;
  int ind = -1;
  for (int i = 0; i < (int)s.size(); ++i) {
    if (s[i] != 'a') {
      ind = i;
      break;
    }
  }
  if (ind == -1) {
    s[(int)s.size() - 1] = 'z';
    cout << s;
  } else {
    for (int i = ind; i < (int)s.size(); i++) {
      if (s[i] == 'a') break;
      s[i]--;
    }
    cout << s;
  }
}
int main() {
  prepare("");
  solve();
  return 0;
}

```