#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int maxn = 1e6 + 10;
const long long int maxn1 = 1e7 + 10;
long long int maxnn = 1e18;
double pie = 3.1415926535;
map<char, char> mpp;
int main() {
  long long int i, j, idx1, idx2;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  mpp['a'] = 'z';
  idx1 = 0;
  for (i = 1, j = 0; i < 26; i++, j++) {
    char x = i + 'a';
    char y = j + 'a';
    mpp[x] = y;
  }
  for (i = 0; i < int(s.size()); i++) {
    if (s[i] == 'a')
      continue;
    else {
      idx1 = i;
      break;
    }
  }
  idx2 = int(s.size());
  for (i = idx1; i < int(s.size()); i++) {
    if (s[i] == 'a') {
      idx2 = i;
      break;
    }
  }
  bool flag = false;
  for (i = idx1; i < idx2; i++) {
    flag = true;
    s[i] = mpp[s[i]];
  }
  if (flag == false) s[int(s.size()) - 1] = 'z';
  cout << s;
}

### Prompt

Develop a solution in CPP to the problem described below:

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 long long int mod = 1e9 + 7;
const long long int maxn = 1e6 + 10;
const long long int maxn1 = 1e7 + 10;
long long int maxnn = 1e18;
double pie = 3.1415926535;
map<char, char> mpp;
int main() {
  long long int i, j, idx1, idx2;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  mpp['a'] = 'z';
  idx1 = 0;
  for (i = 1, j = 0; i < 26; i++, j++) {
    char x = i + 'a';
    char y = j + 'a';
    mpp[x] = y;
  }
  for (i = 0; i < int(s.size()); i++) {
    if (s[i] == 'a')
      continue;
    else {
      idx1 = i;
      break;
    }
  }
  idx2 = int(s.size());
  for (i = idx1; i < int(s.size()); i++) {
    if (s[i] == 'a') {
      idx2 = i;
      break;
    }
  }
  bool flag = false;
  for (i = idx1; i < idx2; i++) {
    flag = true;
    s[i] = mpp[s[i]];
  }
  if (flag == false) s[int(s.size()) - 1] = 'z';
  cout << s;
}

```