#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
long long n, m, ff, c, a, cnt;
string s1, s2;
map<long long, long long> mp;
int main() {
  cin >> s1;
  s2 = "abcdefghijklmnopqrstuvwxyz";
  a = -1;
  if (s1.size() == 1 && s1 == "a") {
    cout << "z" << endl;
    return 0;
  }
  if (s1.size() == 1 && s1 != "a") {
    for (long long i = 0; i < s1.size(); i++) {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  for (long long i = 0; i < s1.size(); i++) {
    if (s1[i] == 'a') {
      a = i;
    } else
      break;
  }
  if (a == s1.size() - 1) {
    if (s1[s1.size() - 1] == 'a')
      s1[s1.size() - 1] = 'z';
    else {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[s1.size() - 1] == s2[j]) {
          s1[s1.size() - 1] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  a = -1;
  for (long long i = 0; i < s1.size(); i++) {
    if (s1[i] == 'a') {
      ff = 1;
      break;
    }
    a = i;
  }
  if (a == -1 && ff == 0) {
    if (s1[s1.size() - 1] == 'a')
      s1[s1.size() - 1] = 'z';
    else {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[s1.size() - 1] == s2[j]) {
          s1[s1.size() - 1] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (a == s1.size() - 1) {
    for (long long i = 0; i < s1.size(); i++) {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (ff == 1 && a == -1) {
    for (long long i = 0; i < s1.size(); i++) {
      if (s1[i] == 'a') {
        a = i;
      } else
        break;
    }
    for (long long i = a + 1; i < s1.size(); i++) {
      if (s1[i] == 'a') {
        break;
      } else
        a = i;
    }
    for (long long i = a; i >= 0; i--) {
      if (s1[i] == 'a')
        break;
      else {
        for (long long j = 0; j < s2.size(); j++) {
          if (s1[i] == s2[j]) {
            s1[i] = s2[j - 1];
            break;
          }
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (ff == 1 && a != -1) {
    for (long long i = a; i >= 0; i--) {
      if (s1[i] == 'a') break;
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
}

### Prompt

Develop a solution in CPP to the problem described below:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
long long n, m, ff, c, a, cnt;
string s1, s2;
map<long long, long long> mp;
int main() {
  cin >> s1;
  s2 = "abcdefghijklmnopqrstuvwxyz";
  a = -1;
  if (s1.size() == 1 && s1 == "a") {
    cout << "z" << endl;
    return 0;
  }
  if (s1.size() == 1 && s1 != "a") {
    for (long long i = 0; i < s1.size(); i++) {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  for (long long i = 0; i < s1.size(); i++) {
    if (s1[i] == 'a') {
      a = i;
    } else
      break;
  }
  if (a == s1.size() - 1) {
    if (s1[s1.size() - 1] == 'a')
      s1[s1.size() - 1] = 'z';
    else {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[s1.size() - 1] == s2[j]) {
          s1[s1.size() - 1] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  a = -1;
  for (long long i = 0; i < s1.size(); i++) {
    if (s1[i] == 'a') {
      ff = 1;
      break;
    }
    a = i;
  }
  if (a == -1 && ff == 0) {
    if (s1[s1.size() - 1] == 'a')
      s1[s1.size() - 1] = 'z';
    else {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[s1.size() - 1] == s2[j]) {
          s1[s1.size() - 1] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (a == s1.size() - 1) {
    for (long long i = 0; i < s1.size(); i++) {
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (ff == 1 && a == -1) {
    for (long long i = 0; i < s1.size(); i++) {
      if (s1[i] == 'a') {
        a = i;
      } else
        break;
    }
    for (long long i = a + 1; i < s1.size(); i++) {
      if (s1[i] == 'a') {
        break;
      } else
        a = i;
    }
    for (long long i = a; i >= 0; i--) {
      if (s1[i] == 'a')
        break;
      else {
        for (long long j = 0; j < s2.size(); j++) {
          if (s1[i] == s2[j]) {
            s1[i] = s2[j - 1];
            break;
          }
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
  if (ff == 1 && a != -1) {
    for (long long i = a; i >= 0; i--) {
      if (s1[i] == 'a') break;
      for (long long j = 0; j < s2.size(); j++) {
        if (s1[i] == s2[j]) {
          s1[i] = s2[j - 1];
          break;
        }
      }
    }
    cout << s1 << endl;
    return 0;
  }
}

```