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>
short a[100010];
int main() {
  register char ch;
  while (ch = getchar(), ch > 'z' || ch < 'a')
    ;
  register int n = 0;
  a[++n] = ch - 'a';
  while (ch = getchar(), ch <= 'z' && ch >= 'a') a[++n] = ch - 'a';
  register int now = 1;
  for (; !a[now] && now <= n; ++now)
    ;
  if (now > n) {
    for (register int i = 1; i < n; ++i) printf("%c", a[i] + 'a');
    puts("z");
    return 0;
  }
  for (; a[now] && now <= n; ++now) --a[now];
  for (register int i = 1; i <= n; ++i) printf("%c", a[i] + 'a');
  return 0;
}
