#include <bits/stdc++.h>
using namespace std;
const int S = 100003;
const int MOD = 1000000007;
const double pi = 2 * acos(0.0);
int _I() {
  int x;
  scanf("%d", &x);
  return x;
}
long long _LL() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int dirX[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dirY[] = {0, 1, 0, -1, 1, -1, -1, 1};
int rX[] = {1, 1, 2, 2, -1, -1, -2, -2};
int rY[] = {2, -2, 1, -1, 2, -2, 1, -1};
template <class T>
T Distance(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
};
int sset(int N, int pos) { return N = N | (1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
int ar[S];
void Do() {
  string s;
  cin >> s;
  int sz = s.size();
  int flag = 0;
  for (int i = 0; i < sz; i++) {
    if (s[i] != 'a') {
      flag = 1;
      s[i] = s[i] - 1;
    } else if (flag)
      break;
  }
  if (!flag) {
    if (s[sz - 1] == 'a')
      s[sz - 1] = 'z';
    else
      s[sz - 1] -= 1;
  }
  cout << s << endl;
}
int main() {
  Do();
  return 0;
}

### 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;
const int S = 100003;
const int MOD = 1000000007;
const double pi = 2 * acos(0.0);
int _I() {
  int x;
  scanf("%d", &x);
  return x;
}
long long _LL() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int dirX[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dirY[] = {0, 1, 0, -1, 1, -1, -1, 1};
int rX[] = {1, 1, 2, 2, -1, -1, -2, -2};
int rY[] = {2, -2, 1, -1, 2, -2, 1, -1};
template <class T>
T Distance(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
};
int sset(int N, int pos) { return N = N | (1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
int ar[S];
void Do() {
  string s;
  cin >> s;
  int sz = s.size();
  int flag = 0;
  for (int i = 0; i < sz; i++) {
    if (s[i] != 'a') {
      flag = 1;
      s[i] = s[i] - 1;
    } else if (flag)
      break;
  }
  if (!flag) {
    if (s[sz - 1] == 'a')
      s[sz - 1] = 'z';
    else
      s[sz - 1] -= 1;
  }
  cout << s << endl;
}
int main() {
  Do();
  return 0;
}

```