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;
string s, s2;
int i, j, sLen;
int main() {
  cin >> s;
  i = 0;
  sLen = s.size();
  for (i = 0; i < sLen; i++) {
    if (s[i] != 'a') {
      break;
    }
  }
  if (i == sLen) {
    s[sLen - 1] = 'z';
    cout << s;
  } else {
    for (j = i; j < sLen; j++) {
      if (s[j] == 'a') {
        break;
      }
    }
    if (j == sLen) {
      for (j = i; j < sLen; j++) {
        s[j] = s[j] - 1;
      }
    } else {
      for (int x = i; x < j; x++) {
        s[x] = s[x] - 1;
      }
    }
    cout << s;
  }
}
