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() {
  string s;
  cin >> s;
  bool all = true;
  if (s.length() == 1 && s[0] == 'a')
    cout << "z";
  else {
    int i = 0;
    while (s[i] != '\0') {
      if (s[i] != 'a') {
        all = false;
        break;
      }
      i++;
    }
    if (all == true) {
      int n = s.length();
      s[n - 1] = 'z';
      cout << s;
    } else {
      bool start = false, done = false;
      int j = 0;
      string temp = "";
      while (j < s.length()) {
        if (s[j] == 'a' && start == false) {
          temp.push_back(s[j]);
          j++;
        } else if (s[j] != 'a' && start == false) {
          start = true;
          while (j < s.length() && s[j] != 'a') {
            char c = s[j] - 1;
            temp.push_back(c);
            j++;
          }
          done = true;
        } else if (done == true) {
          temp.push_back(s[j]);
          j++;
        }
      }
      cout << temp;
    }
  }
}
