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.
#include <bits/stdc++.h>
using namespace std;
char a[100005];
int flag = 0, k, b = 0;
int main() {
  cin >> a;
  int n = strlen(a);
  if (n == 1 && a[0] == 'a')
    cout << "z";
  else {
    for (int i = 0; i < n; i++) {
      if (a[i] == 'a') {
        k = i;
        b = 1;
        break;
      }
    }
    if (b) {
      if (k > 0) {
        for (int i = 0; i < k; i++) {
          if (a[i] != 'a') {
            a[i] = a[i] - 1;
            flag = 1;
          } else if (a[i] == 'a' && flag)
            break;
        }
      } else if (k == 0)
        for (int i = 1; i < n; i++) {
          if (a[i] != 'a') {
            a[i] = a[i] - 1;
            flag = 1;
          } else if (a[i] == 'a' && flag)
            break;
          else
            continue;
        }
      if (flag == 0) a[n - 1] = 'z';
    } else {
      for (int i = 0; i < n; i++) a[i] = a[i] - 1;
    }
    for (int i = 0; i < n; i++) cout << a[i];
  }
  return 0;
}
