#include <bits/stdc++.h>
using namespace std;
template <typename T>
void setmax(T& x, T y) {
  x = max(x, y);
}
template <typename T>
void setmin(T& x, T y) {
  x = min(x, y);
}
const double PI = acos(-1.0);
const long long INF = 1e9 + 47;
const long long LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  string s;
  cin >> s;
  string t = s;
  sort(t.begin(), t.end());
  if (t.back() == 'a') {
    t.back() = 'z';
    cout << t << endl;
    return 0;
  }
  for (int i = (0); i < ((int)((s).size())); ++i)
    if (s[i] == 'a') {
      cout << s[i];
    } else {
      int id = (int)((s).size());
      for (int j = (i); j < ((int)((s).size())); ++j)
        if (s[j] == 'a') {
          id = j;
          break;
        }
      for (int j = (i); j < (id); ++j) {
        cout << (char)(s[j] - 1);
      }
      for (int j = (id); j < ((int)((s).size())); ++j) {
        cout << s[j];
      }
      cout << endl;
      return 0;
    }
  cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
  return 0;
}

### Prompt

Please create a solution in CPP 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 <typename T>
void setmax(T& x, T y) {
  x = max(x, y);
}
template <typename T>
void setmin(T& x, T y) {
  x = min(x, y);
}
const double PI = acos(-1.0);
const long long INF = 1e9 + 47;
const long long LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  string s;
  cin >> s;
  string t = s;
  sort(t.begin(), t.end());
  if (t.back() == 'a') {
    t.back() = 'z';
    cout << t << endl;
    return 0;
  }
  for (int i = (0); i < ((int)((s).size())); ++i)
    if (s[i] == 'a') {
      cout << s[i];
    } else {
      int id = (int)((s).size());
      for (int j = (i); j < ((int)((s).size())); ++j)
        if (s[j] == 'a') {
          id = j;
          break;
        }
      for (int j = (i); j < (id); ++j) {
        cout << (char)(s[j] - 1);
      }
      for (int j = (id); j < ((int)((s).size())); ++j) {
        cout << s[j];
      }
      cout << endl;
      return 0;
    }
  cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
  return 0;
}

```