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() {
  ios::sync_with_stdio(0);
  string s;
  cin >> s;
  pair<bool, int> flagStart = make_pair(false, -1);
  pair<bool, int> flagEnd = make_pair(false, -1);
  for (int i = 0; i < s.size() && (!flagStart.first || !flagEnd.first); ++i) {
    if (s[i] > 'a' && !flagStart.first) {
      flagStart = make_pair(true, i);
    } else if (s[i] == 'a' && flagStart.first) {
      flagEnd = make_pair(true, i);
    }
    if (i == s.size() - 1 && !flagEnd.first) {
      flagEnd = make_pair(true, s.size());
    }
  }
  if (!flagStart.first) {
    for (int i = 0; i < s.size() - 1; ++i) {
      cout << s[i];
    }
    cout << 'z';
  } else {
    for (int j = 0; j < flagStart.second; ++j) {
      cout << s[j];
    }
    for (int j = flagStart.second; j < flagEnd.second; ++j) {
      char a = s[j];
      a--;
      cout << a;
    }
    for (int j = flagEnd.second; j < s.size(); ++j) {
      cout << s[j];
    }
  }
  return 0;
}
