#include <bits/stdc++.h>
using namespace std;
void SO() { cout << endl; }
template <typename S, typename... Strings>
void SO(S x, const Strings &...rest) {
  cout << x << ' ';
  SO(rest...);
}
const long double PI = 3.1415926535897932384626433832795;
const int v5 = 100000;
const int v9 = 1000000000;
const int v6 = 1000000;
inline long long int ABS(long long int a) {
  if (a < 0) return (-a);
  return a;
}
inline long long int min(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
inline long long int max(long long int a, long long int b, long long int c) {
  return max(a, max(b, c));
}
inline void AI(long long int x[], long long int n) {
  for (long long int i = 0; i < (n); ++i) cin >> (x[i]);
}
inline void VI(vector<long long int> &arr, long long int n) {
  for (long long int i = 0; i < (n); ++i) {
    long long int x;
    cin >> (x);
    arr.push_back(x);
  };
}
long long int n, m, k, c = 0;
long long int a[4000001];
map<long long int, vector<long long int> > g;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s, nw;
  cin >> (s);
  long long int i = 0, ln = s.length();
  while (i < ln and s[i] == 'a') {
    nw += 'a';
    i++;
  }
  while (i < ln and s[i] != 'a') {
    nw += char(int(s[i]) - 1);
    i++;
  }
  while (i < ln) {
    nw += s[i];
    i++;
  }
  if (nw == s) {
    if (nw[ln - 1] == 'a')
      nw[ln - 1] = 'z';
    else
      nw[ln - 1] = char(int(s[ln - 1]) - 1);
  }
  SO(nw);
  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;
void SO() { cout << endl; }
template <typename S, typename... Strings>
void SO(S x, const Strings &...rest) {
  cout << x << ' ';
  SO(rest...);
}
const long double PI = 3.1415926535897932384626433832795;
const int v5 = 100000;
const int v9 = 1000000000;
const int v6 = 1000000;
inline long long int ABS(long long int a) {
  if (a < 0) return (-a);
  return a;
}
inline long long int min(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
inline long long int max(long long int a, long long int b, long long int c) {
  return max(a, max(b, c));
}
inline void AI(long long int x[], long long int n) {
  for (long long int i = 0; i < (n); ++i) cin >> (x[i]);
}
inline void VI(vector<long long int> &arr, long long int n) {
  for (long long int i = 0; i < (n); ++i) {
    long long int x;
    cin >> (x);
    arr.push_back(x);
  };
}
long long int n, m, k, c = 0;
long long int a[4000001];
map<long long int, vector<long long int> > g;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s, nw;
  cin >> (s);
  long long int i = 0, ln = s.length();
  while (i < ln and s[i] == 'a') {
    nw += 'a';
    i++;
  }
  while (i < ln and s[i] != 'a') {
    nw += char(int(s[i]) - 1);
    i++;
  }
  while (i < ln) {
    nw += s[i];
    i++;
  }
  if (nw == s) {
    if (nw[ln - 1] == 'a')
      nw[ln - 1] = 'z';
    else
      nw[ln - 1] = char(int(s[ln - 1]) - 1);
  }
  SO(nw);
  return 0;
}

```