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;
string solve(string &S) {
  bool broken = false;
  if (S.size() == 1) {
    if (S[0] == 'a') {
      S[0] = 'z';
      return S;
    }
    if (S[0] != 'a') {
      S[0] = S[0] - 1;
      return S;
    }
  }
  for (int i = 0; i <= S.size() - 1; ++i) {
    if (S[i] != 'a') {
      S[i] = S[i] - 1;
      broken = true;
    } else if (S[i] == 'a') {
      if (i == S.size() - 1) S[i] == 'z';
      if (broken == true) return S;
      if (i == S.size() - 1) S[i] = 'z';
    }
  }
  return S;
}
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  string S;
  cin >> S;
  cout << solve(S) << endl;
  return 0;
}
