#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T, class U>
inline T tmin(T a, U b) {
  return (a < b) ? a : b;
}
template <class T, class U>
inline T tmax(T a, U b) {
  return (a > b) ? a : b;
}
template <class T, class U>
inline void amax(T &a, U b) {
  if (b > a) a = b;
}
template <class T, class U>
inline void amin(T &a, U b) {
  if (b < a) a = b;
}
template <class T>
inline T tabs(T a) {
  return (a > 0) ? a : -a;
}
template <class T>
T gcd(T a, T b) {
  while (b != 0) {
    T c = a;
    a = b;
    b = c % b;
  }
  return a;
}
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  int st = s.size(), en = s.size();
  for (size_t i = 0; i < s.size(); i++) {
    if (s[i] != 'a') {
      st = i;
      break;
    }
  }
  for (size_t i = st; i < s.size(); i++) {
    if (s[i] == 'a') {
      en = i;
      break;
    }
  }
  if (st < en) {
    for (size_t i = st; i < en; i++) {
      s[i] -= 1;
    }
  } else {
    s[s.size() - 1] = 'z';
  }
  cout << s << endl;
  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;
const int MOD = 1000000007;
template <class T, class U>
inline T tmin(T a, U b) {
  return (a < b) ? a : b;
}
template <class T, class U>
inline T tmax(T a, U b) {
  return (a > b) ? a : b;
}
template <class T, class U>
inline void amax(T &a, U b) {
  if (b > a) a = b;
}
template <class T, class U>
inline void amin(T &a, U b) {
  if (b < a) a = b;
}
template <class T>
inline T tabs(T a) {
  return (a > 0) ? a : -a;
}
template <class T>
T gcd(T a, T b) {
  while (b != 0) {
    T c = a;
    a = b;
    b = c % b;
  }
  return a;
}
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  int st = s.size(), en = s.size();
  for (size_t i = 0; i < s.size(); i++) {
    if (s[i] != 'a') {
      st = i;
      break;
    }
  }
  for (size_t i = st; i < s.size(); i++) {
    if (s[i] == 'a') {
      en = i;
      break;
    }
  }
  if (st < en) {
    for (size_t i = st; i < en; i++) {
      s[i] -= 1;
    }
  } else {
    s[s.size() - 1] = 'z';
  }
  cout << s << endl;
  return 0;
}

```