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;
const double PI = acos(-1.0);
const long long inf = 1ll * (1e18);
const int MAX = 26;
const int mod = 10007;
string s;
int main() {
  while (cin >> s) {
    int l, r, e;
    e = s.size();
    l = 0;
    while (l < e && s[l] == 'a') l++;
    if (l == e) {
      l = r = e - 1;
    } else {
      r = l;
      while (r < e && s[r] != 'a') r++;
      r--;
    }
    for (long long(i) = (0); (i) <= ((e - 1)); (i)++) {
      if (i >= l && i <= r) {
        if (s[i] == 'a')
          putchar('z');
        else
          putchar(s[i] - 1);
      } else {
        putchar(s[i]);
      }
    }
    putchar('\n');
  }
}
