#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int MOD = (int)1e9;
const long long llINF = (long long)4e18 + 7;
const int INF = (int)1e9 + 7;
const double eps = 1e-9;
const int MAXN = (int)1e6 + 7;
const double pi = acos(-1);
long long a[MAXN];
int main() {
  string s;
  cin >> s;
  int n = s.size();
  int pos = INF;
  for (int i = 0; i < n; ++i) {
    if (s[i] > 'a') {
      pos = i;
      break;
    }
  }
  if (pos == INF) {
    for (int i = 0; i < n - 1; ++i) {
      cout << s[i];
    }
    cout << 'z';
    return 0;
  }
  int j;
  for (j = pos; s[j] > 'a'; ++j) {
    continue;
  }
  for (int i = 0; i < pos; ++i) {
    cout << s[i];
  }
  for (int i = pos; i < j; ++i) {
    cout << char(s[i] - 1);
  }
  for (int i = j; i < n; ++i) {
    cout << s[i];
  }
  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>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int MOD = (int)1e9;
const long long llINF = (long long)4e18 + 7;
const int INF = (int)1e9 + 7;
const double eps = 1e-9;
const int MAXN = (int)1e6 + 7;
const double pi = acos(-1);
long long a[MAXN];
int main() {
  string s;
  cin >> s;
  int n = s.size();
  int pos = INF;
  for (int i = 0; i < n; ++i) {
    if (s[i] > 'a') {
      pos = i;
      break;
    }
  }
  if (pos == INF) {
    for (int i = 0; i < n - 1; ++i) {
      cout << s[i];
    }
    cout << 'z';
    return 0;
  }
  int j;
  for (j = pos; s[j] > 'a'; ++j) {
    continue;
  }
  for (int i = 0; i < pos; ++i) {
    cout << s[i];
  }
  for (int i = pos; i < j; ++i) {
    cout << char(s[i] - 1);
  }
  for (int i = j; i < n; ++i) {
    cout << s[i];
  }
  return 0;
}

```