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, s1;
  int a = -1, b = -1;
  cin >> s;
  long long int flag = 0;
  for (long long int i = 0; i < s.size(); i++) {
    if (s[i] == 'a' && flag == 0) a = i;
    if (s[i] == 'a' && flag == 1) {
      b = i;
      break;
    } else if (s[i] > 'a' && s[i] <= 'z') {
      s1 += s[i];
      flag = 1;
    }
  }
  if (s1.size() == 0) {
    for (long long int i = 0; i < s.size() - 1; i++) {
      cout << s[i];
    }
    cout << "z" << endl;
  } else {
    if (a != -1)
      for (long long int i = 0; i <= a; i++) cout << s[i];
    for (long long int i = 0; i < s1.size(); i++) {
      cout << char(s1[i] - 1);
    }
    if (b != -1)
      for (long long int i = b; i < s.size(); i++) cout << s[i];
  }
  cout << endl;
  return 0;
}
