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;
long long a[110000], b[110000];
char s1[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
               'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main() {
  string s;
  long long i, j, d = 0;
  cin >> s;
  for (i = 0; i < s.size(); i++)
    if (s[i] == 'a') d++;
  if (d == s.size()) {
    s[d - 1] = 'z';
    cout << s;
    return 0;
  }
  for (i = 0; i < s.size(); i++) {
    if (s[i] != 'a' && s[i + 1] != 'a') {
      long long k = s[i] - 'a';
      s[i] = s1[k - 1];
    } else if (s[i] != 'a' && s[i + 1] == 'a') {
      long long k = s[i] - 'a';
      s[i] = s1[k - 1];
      cout << s;
      return 0;
    }
  }
  cout << s;
}
