#include <bits/stdc++.h>
using namespace std;
char s[100005];
int main() {
  scanf("%s", s);
  int len = strlen(s), p1 = -1, p2 = len;
  bool tag1(true), tag2(true), tag3(true);
  int s1, s2;
  if (len == 1) {
    if (s[0] == 'a')
      printf("%c\n", 'z');
    else
      printf("%c\n", s[0]--);
    return 0;
  }
  if (s[0] != 'a') {
    for (int i = 0; i < len; i++) {
      if (s[i] != 'a')
        s[i]--;
      else
        break;
    }
    for (int i = 0; i < len; i++) {
      printf("%c", s[i]);
    }
    printf("\n");
    return 0;
  }
  for (int i = 0; i < len; i++)
    if (s[i] != 'a') {
      p1 = i;
      tag1 = false;
      break;
    }
  if (tag1) {
    s[len - 1] = 'z';
    for (int i = 0; i < len; i++) printf("%c", s[i]);
    printf("\n");
    return 0;
  }
  for (int i = p1; i < len; i++) {
    if (!tag1 && s[i] == 'a') {
      p2 = i - 1;
      break;
    }
  }
  for (int i = p1; i <= p2; i++) s[i]--;
  for (int i = 0; i < len; i++) printf("%c", s[i]);
  printf("\n");
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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 s[100005];
int main() {
  scanf("%s", s);
  int len = strlen(s), p1 = -1, p2 = len;
  bool tag1(true), tag2(true), tag3(true);
  int s1, s2;
  if (len == 1) {
    if (s[0] == 'a')
      printf("%c\n", 'z');
    else
      printf("%c\n", s[0]--);
    return 0;
  }
  if (s[0] != 'a') {
    for (int i = 0; i < len; i++) {
      if (s[i] != 'a')
        s[i]--;
      else
        break;
    }
    for (int i = 0; i < len; i++) {
      printf("%c", s[i]);
    }
    printf("\n");
    return 0;
  }
  for (int i = 0; i < len; i++)
    if (s[i] != 'a') {
      p1 = i;
      tag1 = false;
      break;
    }
  if (tag1) {
    s[len - 1] = 'z';
    for (int i = 0; i < len; i++) printf("%c", s[i]);
    printf("\n");
    return 0;
  }
  for (int i = p1; i < len; i++) {
    if (!tag1 && s[i] == 'a') {
      p2 = i - 1;
      break;
    }
  }
  for (int i = p1; i <= p2; i++) s[i]--;
  for (int i = 0; i < len; i++) printf("%c", s[i]);
  printf("\n");
  return 0;
}

```