#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int i = 0;
  string str = "";
  if (s.size() == 1) {
    if (s[0] == 'a')
      cout << 'z' << endl;
    else
      cout << char(s[0] - 1) << endl;
    return 0;
  }
  while (s[i] == 'a' && i < s.size()) i++;
  if (i == s.size()) {
    for (int l = 0; l < s.size() - 1; l++) cout << 'a';
    cout << 'z' << endl;
    return 0;
  }
  for (; i < s.size(); i++) {
    if (s[i] != 'a')
      str += s[i];
    else
      break;
  }
  for (int j = 0; j < str.size(); j++) {
    if (str[j] == 'a')
      str[j] = 'z';
    else
      str[j] = char(str[j] - 1);
  }
  for (; i < s.size(); i++) str += s[i];
  reverse(str.begin(), str.end());
  while (str.size() < s.size()) {
    str += 'a';
  }
  reverse(str.begin(), str.end());
  cout << str << endl;
  return 0;
}

### Prompt

In CPP, your task is to solve 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 i = 0;
  string str = "";
  if (s.size() == 1) {
    if (s[0] == 'a')
      cout << 'z' << endl;
    else
      cout << char(s[0] - 1) << endl;
    return 0;
  }
  while (s[i] == 'a' && i < s.size()) i++;
  if (i == s.size()) {
    for (int l = 0; l < s.size() - 1; l++) cout << 'a';
    cout << 'z' << endl;
    return 0;
  }
  for (; i < s.size(); i++) {
    if (s[i] != 'a')
      str += s[i];
    else
      break;
  }
  for (int j = 0; j < str.size(); j++) {
    if (str[j] == 'a')
      str[j] = 'z';
    else
      str[j] = char(str[j] - 1);
  }
  for (; i < s.size(); i++) str += s[i];
  reverse(str.begin(), str.end());
  while (str.size() < s.size()) {
    str += 'a';
  }
  reverse(str.begin(), str.end());
  cout << str << endl;
  return 0;
}

```