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;
  int n = s.size(), a[n];
  for (int i = 0; i < n; i++) {
    a[i] = (s[i] - 'a');
  }
  int p = 0;
  while (p < n) {
    if (a[p]) break;
    p++;
  }
  int q = p + 1;
  while (q < n) {
    if (!a[q]) break;
    q++;
  }
  if (p == n) {
    for (int i = 0; i < n - 1; i++) cout << "a";
    cout << "z";
  } else {
    for (int i = p; i < q; i++) {
      a[i]--;
    }
    for (int i = 0; i < n; i++) {
      char h = ('a' + a[i]);
      cout << h;
    }
  }
}
