#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool isprime(long long p) {
  if (p < 2) return false;
  if (p == 2) return true;
  if (p % 2 == 0) return false;
  double limit = sqrt(p);
  for (long long i = 3; i <= limit; i += 2) {
    if ((p % i) == 0) return false;
  }
  return true;
}
long long fac(long long n) {
  long long an = 1;
  while (n > 1) {
    an *= n;
    n--;
  }
  return an;
}
long long kor(long long n, long long st) {
  long long nn = n;
  if (st == 0) return 1;
  while (st > 1) {
    n = (n * nn);
    st--;
  }
  return n;
}
map<int, queue<int> > mpp;
map<int, queue<int> >::iterator it;
set<char> uni;
set<int>::iterator iter;
priority_queue<int> pq;
int main() {
  ios::sync_with_stdio(false);
  string a;
  cin >> a;
  int flag = 0;
  for (int i = 0; i < a.size(); ++i) {
    if (a[i] != 'a') {
      a[i]--;
      flag = 1;
    } else if (flag == 1)
      break;
  }
  if (flag == 0) a[a.size() - 1] = 'z';
  cout << a;
  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;
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool isprime(long long p) {
  if (p < 2) return false;
  if (p == 2) return true;
  if (p % 2 == 0) return false;
  double limit = sqrt(p);
  for (long long i = 3; i <= limit; i += 2) {
    if ((p % i) == 0) return false;
  }
  return true;
}
long long fac(long long n) {
  long long an = 1;
  while (n > 1) {
    an *= n;
    n--;
  }
  return an;
}
long long kor(long long n, long long st) {
  long long nn = n;
  if (st == 0) return 1;
  while (st > 1) {
    n = (n * nn);
    st--;
  }
  return n;
}
map<int, queue<int> > mpp;
map<int, queue<int> >::iterator it;
set<char> uni;
set<int>::iterator iter;
priority_queue<int> pq;
int main() {
  ios::sync_with_stdio(false);
  string a;
  cin >> a;
  int flag = 0;
  for (int i = 0; i < a.size(); ++i) {
    if (a[i] != 'a') {
      a[i]--;
      flag = 1;
    } else if (flag == 1)
      break;
  }
  if (flag == 0) a[a.size() - 1] = 'z';
  cout << a;
  return 0;
}

```