#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  long long i;
  vector<long long> v;
  long long p = s.length();
  long long pp = 0;
  for (i = 0; i <= p - 1; i++) {
    if (s[i] != 'a') {
      v.push_back(i);
      pp++;
    }
  }
  long long x = 1;
  vector<long long> v2;
  map<long long, long long> m;
  for (i = pp - 2; i >= 0; i--) {
    if (v[i + 1] - v[i] == 1) {
      x++;
    } else {
      v2.push_back(x);
      m[x] = v[i + 1];
      x = 1;
    }
  }
  v2.push_back(x);
  if (pp != 0) {
    m[x] = v[0];
  }
  sort(v2.rbegin(), v2.rend());
  if (pp != 0) {
    for (i = m[x]; i <= m[x] + (x - 1); i++) {
      s[i] = s[i] - 1;
    }
  } else {
    for (i = p - 1; i <= p - 1; i++) {
      s[i] = 'z';
    }
  }
  cout << s << "\n";
}

### Prompt

Please create a solution in CPP to 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;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  long long i;
  vector<long long> v;
  long long p = s.length();
  long long pp = 0;
  for (i = 0; i <= p - 1; i++) {
    if (s[i] != 'a') {
      v.push_back(i);
      pp++;
    }
  }
  long long x = 1;
  vector<long long> v2;
  map<long long, long long> m;
  for (i = pp - 2; i >= 0; i--) {
    if (v[i + 1] - v[i] == 1) {
      x++;
    } else {
      v2.push_back(x);
      m[x] = v[i + 1];
      x = 1;
    }
  }
  v2.push_back(x);
  if (pp != 0) {
    m[x] = v[0];
  }
  sort(v2.rbegin(), v2.rend());
  if (pp != 0) {
    for (i = m[x]; i <= m[x] + (x - 1); i++) {
      s[i] = s[i] - 1;
    }
  } else {
    for (i = p - 1; i <= p - 1; i++) {
      s[i] = 'z';
    }
  }
  cout << s << "\n";
}

```