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>
const int MAX = 1e5 + 10;
int n;
char s[MAX];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  bool check = true;
  for (int i = 1; i <= n; ++i)
    if (s[i] != 'a') {
      check = false;
      break;
    }
  if (check) {
    for (int i = 1; i < n; ++i) printf("a");
    printf("z");
    return 0;
  }
  int pos = 1;
  while (s[pos] == 'a') {
    printf("a");
    ++pos;
  }
  check = true;
  for (int i = pos; i <= n; ++i)
    if (check && s[i] != 'a')
      printf("%c", s[i] - 1);
    else {
      check = false;
      printf("%c", s[i]);
    }
  return 0;
}
