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 str;
void funk(int x) {
  char ch;
  int i, j, a, b, n;
  n = str.size();
  for (i = x; i < n; i++) {
    if (str[i] != 'a') {
      a = str[i] - 1;
      ch = a;
      str[i] = a;
    } else
      return;
  }
  return;
}
int main() {
  ios::sync_with_stdio(false);
  int i, j, x, y, n, m, a, b, c, d;
  cin >> str;
  n = str.size();
  for (i = 0; i < n; i++) {
    if (str[i] != 'a') {
      funk(i);
      break;
    } else if (i == n - 1) {
      str[i] = 'z';
    }
  }
  cout << str;
  return 0;
}
