#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int mcm(int a, int b) { return a * b / gcd(a, b); }
int pot(int a, int b) {
  return b ? (pot(a, b >> 1)) * (pot(a, b >> 1)) * (b & 1 ? a : 1) : 1;
}
string sh(string in, int f, int t) {
  for (int i = (f); i < t; i++) in[i] = (in[i] - 'a' - 1 + 26) % 26 + 'a';
  return in;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  int a = -1, b = n;
  for (int i = (0); i < n; i++) {
    if (s[i] == 'a') {
      a = i;
      break;
    }
  }
  if (a < 0)
    cout << sh(s, 0, n) << endl;
  else if (a != 0)
    cout << sh(s, 0, a) << endl;
  else {
    while (a < n && s[a] == 'a') a++;
    if (a == n) {
      cout << sh(s, n - 1, n) << endl;
      return 0;
    }
    for (int i = (a); i < n; i++) {
      if (s[i] == 'a') {
        cout << sh(s, a, i) << endl;
        return 0;
      }
    }
    cout << sh(s, a, n) << endl;
  }
}

### Prompt

Please provide a cpp coded solution 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;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int mcm(int a, int b) { return a * b / gcd(a, b); }
int pot(int a, int b) {
  return b ? (pot(a, b >> 1)) * (pot(a, b >> 1)) * (b & 1 ? a : 1) : 1;
}
string sh(string in, int f, int t) {
  for (int i = (f); i < t; i++) in[i] = (in[i] - 'a' - 1 + 26) % 26 + 'a';
  return in;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  int a = -1, b = n;
  for (int i = (0); i < n; i++) {
    if (s[i] == 'a') {
      a = i;
      break;
    }
  }
  if (a < 0)
    cout << sh(s, 0, n) << endl;
  else if (a != 0)
    cout << sh(s, 0, a) << endl;
  else {
    while (a < n && s[a] == 'a') a++;
    if (a == n) {
      cout << sh(s, n - 1, n) << endl;
      return 0;
    }
    for (int i = (a); i < n; i++) {
      if (s[i] == 'a') {
        cout << sh(s, a, i) << endl;
        return 0;
      }
    }
    cout << sh(s, a, n) << endl;
  }
}

```