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;
const int maxn = 1e5 + 5;
char s[maxn];
bool Check(char s[]) {
  for (int i = 0; i < strlen(s); i++)
    if (s[i] != 'a') return false;
  return true;
}
int main() {
  cin >> s;
  if (Check(s))
    s[strlen(s) - 1] = 'z';
  else {
    for (int i = 0; i < strlen(s); i++)
      if (s[i] != 'a') {
        int p = i;
        while (s[p] != 'a' && p < strlen(s)) p++;
        for (int j = i; j < p; j++)
          if (s[j] == 'a')
            s[j] = 'z';
          else
            s[j]--;
        break;
      }
  }
  cout << s << endl;
  return 0;
}
