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.
import java.util.*;
public class Main{

  public static void main(String[] args){
      Scanner sc = new Scanner(System.in);
      String s = sc.next();
      int i = 0;
      for(; i < s.length(); i++) {
        if(s.charAt(i) != 'a')
          break;
      }
      if(i == s.length()) {
        System.out.println(s.substring(0, s.length() - 1) + 'z');
        return;
      }
      int j = i + 1;
      for(; j < s.length(); j++) {
        if(s.charAt(j) == 'a')
          break;
      }
      
      StringBuilder sb = new StringBuilder();
      for(int k = 0; k < i; k++)
        sb.append(s.charAt(k));
      for(int k = i; k < j; k++) {
        sb.append((char)((int)s.charAt(k) - 1));
      }
      for(int k = j; k < s.length(); k++)
        sb.append(s.charAt(k));

      System.out.println(sb.toString());
  }
}
