#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
const int MAXN = 1050;
int status[(MAXN / 32) + 10];
bool check(int n, int pos) { return (bool)(n & (1 << pos)); }
int SET(int n, int pos) { return n = n | (1 << pos); }
void sieve() {
  int sqrtN = int(sqrt(MAXN));
  status[1 >> 5] = SET(status[1 >> 5], 1 & 31);
  for (int j = 4; j <= MAXN; j = j + 2)
    status[j >> 5] = SET(status[j >> 5], j & 31);
  for (int i = 3; i <= sqrtN; i = i + 2) {
    if (check(status[i >> 5], i & 31) == 0) {
      for (int j = i * i; j <= MAXN; j = j + (i << 1)) {
        status[j >> 5] = SET(status[j >> 5], j & 31);
      }
    }
  }
}
int main() {
  string str;
  cin >> str;
  int i;
  string temp = str;
  for (i = 0; i < str.size(); i++) {
    if (str[i] != 'a') break;
  }
  for (int j = i; j < str.size(); j++) {
    if (str[j] == 'a')
      break;
    else
      str[j] = str[j] - 1;
  }
  if (temp == str) {
    str[str.size() - 1] = 'z';
    cout << str;
  } else
    cout << str;
}

### Prompt

In cpp, your task is to solve 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 MOD = 1000000007;
const int MAXN = 1050;
int status[(MAXN / 32) + 10];
bool check(int n, int pos) { return (bool)(n & (1 << pos)); }
int SET(int n, int pos) { return n = n | (1 << pos); }
void sieve() {
  int sqrtN = int(sqrt(MAXN));
  status[1 >> 5] = SET(status[1 >> 5], 1 & 31);
  for (int j = 4; j <= MAXN; j = j + 2)
    status[j >> 5] = SET(status[j >> 5], j & 31);
  for (int i = 3; i <= sqrtN; i = i + 2) {
    if (check(status[i >> 5], i & 31) == 0) {
      for (int j = i * i; j <= MAXN; j = j + (i << 1)) {
        status[j >> 5] = SET(status[j >> 5], j & 31);
      }
    }
  }
}
int main() {
  string str;
  cin >> str;
  int i;
  string temp = str;
  for (i = 0; i < str.size(); i++) {
    if (str[i] != 'a') break;
  }
  for (int j = i; j < str.size(); j++) {
    if (str[j] == 'a')
      break;
    else
      str[j] = str[j] - 1;
  }
  if (temp == str) {
    str[str.size() - 1] = 'z';
    cout << str;
  } else
    cout << str;
}

```