#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)3e5 + 10;
const int inf = (int)1e9 + 5;
const long long llinf = (long long)1e18 + 5;
char a[maxn];
int kol[maxn];
long int n, i, m, k, ford, forb, d, b, z, pos1, pos2;
int main() {
  cin >> a;
  z = 0;
  b = 0;
  n = strlen(a);
  for (i = 0; i < n; i++) {
    if (a[i] == 'a') {
      b++;
    }
    if ((a[i] != 'a') and (a[i + 1] == 'a')) {
      kol[0] = i + 1;
      z++;
      break;
    }
  }
  if (b == n) {
    for (i = 0; i < n - 1; i++) {
      cout << a[i];
    }
    cout << 'z';
    return 0;
  }
  if (z == 0) {
    for (i = 0; i < n; i++) {
      if (a[i] == 'a') {
        cout << a[i];
      } else
        cout << char(int(a[i]) - 1);
    }
    return 0;
  } else {
    for (i = 0; i < kol[0]; i++) {
      if (a[i] == 'a') {
        cout << a[i];
      } else
        cout << char(int(a[i]) - 1);
    }
    for (i = kol[0]; i < n; i++) {
      cout << a[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>
using namespace std;
const int maxn = (int)3e5 + 10;
const int inf = (int)1e9 + 5;
const long long llinf = (long long)1e18 + 5;
char a[maxn];
int kol[maxn];
long int n, i, m, k, ford, forb, d, b, z, pos1, pos2;
int main() {
  cin >> a;
  z = 0;
  b = 0;
  n = strlen(a);
  for (i = 0; i < n; i++) {
    if (a[i] == 'a') {
      b++;
    }
    if ((a[i] != 'a') and (a[i + 1] == 'a')) {
      kol[0] = i + 1;
      z++;
      break;
    }
  }
  if (b == n) {
    for (i = 0; i < n - 1; i++) {
      cout << a[i];
    }
    cout << 'z';
    return 0;
  }
  if (z == 0) {
    for (i = 0; i < n; i++) {
      if (a[i] == 'a') {
        cout << a[i];
      } else
        cout << char(int(a[i]) - 1);
    }
    return 0;
  } else {
    for (i = 0; i < kol[0]; i++) {
      if (a[i] == 'a') {
        cout << a[i];
      } else
        cout << char(int(a[i]) - 1);
    }
    for (i = kol[0]; i < n; i++) {
      cout << a[i];
    }
  }
  return 0;
}

```