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 main(int argc, const char* argv[]) {
  string s;
  cin >> s;
  bool started_substring = false;
  bool ended_substring = false;
  string result = s;
  bool shouldshift = false;
  for (int i = 0; i < s.length(); i++) {
    if (!ended_substring) {
      if (started_substring) {
        if (s[i] == 'a') {
          shouldshift = false;
          ended_substring = true;
        } else
          shouldshift = true;
      } else if (s[i] != 'a' || i == s.length() - 1) {
        started_substring = true;
        shouldshift = true;
      }
    } else
      shouldshift = false;
    result[i] = shouldshift ? (s[i] == 'a' ? 'z' : s[i] - 1) : s[i];
  }
  cout << result;
  return 0;
}
