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>
int main() {
  using namespace std;
  string s;
  char x;
  int i, y, c = 0, d = 0, j;
  cin >> s;
  for (i = 0; i < s.size(); i++) {
    if (s[i] == 'a') {
      c++;
    } else {
      d++;
    }
  }
  if (c == s.size()) {
    for (i = 0; i < s.size() - 1; i++) {
      cout << s[i];
    }
    cout << "z" << endl;
  } else {
    for (i = 0; i < s.size(); i++) {
      if (s[i] == 'a') {
        cout << s[i];
        c++;
        continue;
      }
      if (s[i] != 'a') {
        y = ((int)s[i]) - 1;
        x = (char)y;
        cout << x;
        if (s[i + 1] != 'a') {
          continue;
        }
        if (s[i + 1] == 'a') {
          for (j = i + 1; j < s.size(); j++) {
            cout << s[j];
          }
        }
        break;
      }
    }
  }
  cout << endl;
  return 0;
}
