#include <bits/stdc++.h>
using namespace std;
char shift(char c) {
  int cint = (int)(c - 'a') - 1;
  char ans = (char)cint + 'a';
  if (c == 'a') {
    return 'z';
  }
  return ans;
}
void print_smaller(string s) {
  int sz = (int)s.size();
  int i = 0;
  if (s[0] == 'a') {
    while (s[i] == 'a' && i < sz) {
      cout << 'a';
      i++;
    }
  }
  while (s[i] != 'a' && i < sz) {
    cout << shift(s[i]);
    i++;
  }
  while (i < sz) {
    cout << s[i];
    i++;
  }
  return;
}
int main() {
  string s;
  cin >> s;
  int stop = (int)s.size() - 1;
  int start = 0;
  bool found = false;
  unordered_set<char> distinct;
  for (int i = 0; i < (int)s.size(); ++i) {
    distinct.insert(s[i]);
  }
  if (distinct.size() == 1 && distinct.find('a') != distinct.end()) {
    cout << s.substr(0, s.size() - 1) << 'z';
    return 0;
  } else {
    print_smaller(s);
    return 0;
  }
}

### Prompt

Create a solution in cpp for 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;
char shift(char c) {
  int cint = (int)(c - 'a') - 1;
  char ans = (char)cint + 'a';
  if (c == 'a') {
    return 'z';
  }
  return ans;
}
void print_smaller(string s) {
  int sz = (int)s.size();
  int i = 0;
  if (s[0] == 'a') {
    while (s[i] == 'a' && i < sz) {
      cout << 'a';
      i++;
    }
  }
  while (s[i] != 'a' && i < sz) {
    cout << shift(s[i]);
    i++;
  }
  while (i < sz) {
    cout << s[i];
    i++;
  }
  return;
}
int main() {
  string s;
  cin >> s;
  int stop = (int)s.size() - 1;
  int start = 0;
  bool found = false;
  unordered_set<char> distinct;
  for (int i = 0; i < (int)s.size(); ++i) {
    distinct.insert(s[i]);
  }
  if (distinct.size() == 1 && distinct.find('a') != distinct.end()) {
    cout << s.substr(0, s.size() - 1) << 'z';
    return 0;
  } else {
    print_smaller(s);
    return 0;
  }
}

```