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() {
  char str[100000];
  char ch;
  int k = 0, i = 0, f = 0, n = 0;
  ch = getchar();
  while (ch != '\n') {
    if (f == 0) {
      if (ch == 'a') {
        if (k == 0) {
          str[i] = ch;
        }
        if (k > 0) {
          str[i] = ch;
          f = 1;
        }
        n++;
      } else {
        str[i] = ch - 1;
        k++;
      }
    } else {
      str[i] = ch;
    }
    if (i == 0) {
    } else {
      cout << str[i - 1];
    }
    i++;
    ch = getchar();
  }
  if (i == n) {
    cout << 'z';
  } else {
    cout << str[i - 1];
  }
  return 0;
}
