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() {
  int j = 0, flag = 0;
  string line;
  cin >> line;
  for (int i = 0; i < line.length();) {
    flag = 0;
    if (line[i] != 'a') {
      flag = 1;
      line[i]--;
      for (j = i + 1; j < line.length(); j++) {
        if (line[j] != 'a')
          line[j]--;
        else
          break;
      }
    }
    if (flag)
      break;
    else
      i++;
  }
  if (flag)
    cout << line;
  else {
    for (int i = 0; i < line.length() - 1; i++) {
      printf("%c", line[i]);
    }
    printf("z");
  }
  return 0;
}
