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;
int a[100000];
int main() {
  string st;
  cin >> st;
  int count = 0;
  for (int i = 0; i < st.length(); i++) {
    if (st[i] == 'a') count++;
  }
  if (count == st.length()) {
    for (int i = 0; i < st.length() - 1; i++) printf("a");
    printf("z");
  } else {
    for (int i = 0; i < st.length(); i++) a[i] = (int)st[i];
    int j = 0;
    while (a[j] == 97 && j < st.length()) {
      printf("a");
      j++;
    }
    while (a[j] != 97 && j < st.length()) {
      printf("%c", (char)(a[j] - 1));
      j++;
    }
    while (j < st.length()) {
      printf("%c", (char)a[j]);
      j++;
    }
  }
  return 0;
}
