#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int maxn = (int)1e5 + 10;
const int mod = (int)1e9 + 7;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
long long a, b, c, d, i, j, k, l, t, n, m, p, cs, kk, q, r, s;
char h[1000], o;
double e, f, g;
vector<long long> u, v, w;
vector<pair<long long, long long> > pv;
pair<long long, long long> pp;
string x = "abcdefghijklmnopqrstuvwxyza", y, z;
map<string, long long> mm;
int main() {
  while (cin >> y) {
    a = 0;
    for (i = 0; i < (((y).size())); i++) {
      if (y[i] == 'a') {
        if (a == 0)
          continue;
        else
          break;
      } else {
        y[i] = y[i] - 1;
        a = 1;
      }
    }
    l = ((y).size());
    if (a == 0) y[l - 1] = 122;
    cout << y << endl;
  }
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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 double eps = 1e-9;
const int maxn = (int)1e5 + 10;
const int mod = (int)1e9 + 7;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
long long a, b, c, d, i, j, k, l, t, n, m, p, cs, kk, q, r, s;
char h[1000], o;
double e, f, g;
vector<long long> u, v, w;
vector<pair<long long, long long> > pv;
pair<long long, long long> pp;
string x = "abcdefghijklmnopqrstuvwxyza", y, z;
map<string, long long> mm;
int main() {
  while (cin >> y) {
    a = 0;
    for (i = 0; i < (((y).size())); i++) {
      if (y[i] == 'a') {
        if (a == 0)
          continue;
        else
          break;
      } else {
        y[i] = y[i] - 1;
        a = 1;
      }
    }
    l = ((y).size());
    if (a == 0) y[l - 1] = 122;
    cout << y << endl;
  }
  return 0;
}

```