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;
FILE *stm;
const double PI = 22.0 / 7.0;
const long long MXN = 1e5 + 1;
const long long MNN = 1e3 + 1;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
bool srt(string a, string b) { return a.size() > b.size(); }
int gcd(int a, int b) {
  if (b == 0)
    return a;
  else
    gcd(b, a % b);
}
int lcm(int a, int b) { return (b / gcd(a, b)) * a; }
int main() {
  string first;
  cin >> first;
  int n = first.size();
  int ctr = 0;
  int j = 0;
  while (first[j] == 'a' and j < n) {
    ctr++;
    j++;
  }
  if (ctr == n) {
    first[n - 1] = 'z';
  } else if (first[0] != 'a') {
    for (int i = 0; i < n and first[i] != 'a'; i++) first[i] = first[i] - 1;
  } else if (first[0] == 'a') {
    int i = 0;
    while (first[i] == 'a') {
      i++;
    }
    for (; i < n and first[i] != 'a'; i++) first[i] = first[i] - 1;
  }
  cout << first << endl;
  return 0;
}
