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 int maxn = 1e5;
string s, ans;
int l, r, n;
char C[maxn + 1];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  getline(cin, s);
  n = s.size() - 1;
  l = -1;
  for (int i = 0; i <= n; i++)
    if (s[i] != 'a') {
      l = i;
      break;
    }
  if (l == -1) {
    s[n] = 'z';
    cout << s;
    return 0;
  }
  for (int i = l + 1; i <= n; i++)
    if (s[i] == 'a') {
      r = i;
      break;
    }
  if (r == 0) r = n + 1;
  for (int i = 0; i <= l - 1; i++) C[i] = s[i];
  for (int i = l; i <= r - 1; i++) C[i] = (char)(int(s[i]) - 1);
  for (int i = r; i <= n; i++) C[i] = s[i];
  for (int i = 0; i <= n; i++) cout << C[i];
  return 0;
}
