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.*;
import java.io.*;

public class HelloWorld
{
   public static void main(String[] avgs) throws Exception
   {
      BufferedReader in = new BufferedReader ( new InputStreamReader(System.in) );
      
      try {    
         BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
       }
       catch (Exception e) {
         e.printStackTrace();
       }
      
      char[]s = in.readLine().toCharArray();
      
      int n = s.length;
      boolean did = false;
      
      StringBuilder finals = new StringBuilder();
      
      for (int i = 0; i < n; i++)
         if (s[i]!='a') {
            
            did = true;
            
            for (int j = i; j < n; j++)
               if (s[j]=='a') break; else
                  s[j]=(char)(s[j]-1);
            
            break;
         }
      
      if (!did) {
         
         for (int i = 0; i < n-1; i++) finals.append(s[i]);
         
         finals.append('z');
         
         System.out.println(finals);
         
         System.exit(0);
      }
      
      for (int i = 0; i < n; i++) finals.append(s[i]);
      
      System.out.println(finals);
      
      System.out.close();
   }
}