#include <bits/stdc++.h>
using namespace std;
const long long inf = LONG_MAX;
const long long arr = 10000000;
long long n, b, d, ans;
long long a[arr];
long long u[arr];
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first < b.first;
}
int main(void) {
  string second;
  cin >> second;
  set<char> st;
  n = second.size();
  for (int i = 0; i < n; i++) st.insert(second[i]);
  if (st.size() == 1 && st.find('a') != st.end()) {
    for (int i = 0; i < n - 1; i++) cout << 'a';
    cout << 'z';
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (second[i] == 'a') continue;
    int j = 0;
    for (j = i; j < n; j++)
      if (second[j] == 'a') {
        j--;
        break;
      }
    for (int k = i; k <= j; k++) second[k]--;
    break;
  }
  cout << second << '\n';
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

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 inf = LONG_MAX;
const long long arr = 10000000;
long long n, b, d, ans;
long long a[arr];
long long u[arr];
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first < b.first;
}
int main(void) {
  string second;
  cin >> second;
  set<char> st;
  n = second.size();
  for (int i = 0; i < n; i++) st.insert(second[i]);
  if (st.size() == 1 && st.find('a') != st.end()) {
    for (int i = 0; i < n - 1; i++) cout << 'a';
    cout << 'z';
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (second[i] == 'a') continue;
    int j = 0;
    for (j = i; j < n; j++)
      if (second[j] == 'a') {
        j--;
        break;
      }
    for (int k = i; k <= j; k++) second[k]--;
    break;
  }
  cout << second << '\n';
  return 0;
}

```