#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  string s;
  cin >> s;
  int hash[26] = {};
  for (int i = 0; i < s.size(); ++i) {
    if (s[i] == 'a') hash[s[i] - 97]++;
  }
  if (hash[0] == s.size()) {
    s[s.size() - 1] = 'z';
    cout << s;
    return 0;
  }
  if (hash[0] == 0) {
    for (int i = 0; i < s.size(); ++i) {
      s[i] -= 1;
    }
    cout << s;
    return 0;
  } else {
    if (s[0] != 'a') {
      for (int i = 0; s[i] != 'a'; ++i) {
        s[i] -= 1;
      }
      cout << s;
      return 0;
    } else {
      int c = 0;
      for (int i = 0; i < s.size(); ++i) {
        if (s[i] == 'a')
          for (int j = i + 1; j < s.size(); ++j) {
            if (s[j] != 'a') {
              s[j] -= 1;
              c = -1;
            } else
              break;
          }
        if (c == -1) {
          cout << s;
          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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  string s;
  cin >> s;
  int hash[26] = {};
  for (int i = 0; i < s.size(); ++i) {
    if (s[i] == 'a') hash[s[i] - 97]++;
  }
  if (hash[0] == s.size()) {
    s[s.size() - 1] = 'z';
    cout << s;
    return 0;
  }
  if (hash[0] == 0) {
    for (int i = 0; i < s.size(); ++i) {
      s[i] -= 1;
    }
    cout << s;
    return 0;
  } else {
    if (s[0] != 'a') {
      for (int i = 0; s[i] != 'a'; ++i) {
        s[i] -= 1;
      }
      cout << s;
      return 0;
    } else {
      int c = 0;
      for (int i = 0; i < s.size(); ++i) {
        if (s[i] == 'a')
          for (int j = i + 1; j < s.size(); ++j) {
            if (s[j] != 'a') {
              s[j] -= 1;
              c = -1;
            } else
              break;
          }
        if (c == -1) {
          cout << s;
          return 0;
        }
      }
    }
  }
}

```