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.Arrays;
import java.util.Scanner;
public class LettersCyclicShift {    
    public static void main(String []args){
        Scanner in=new Scanner(System.in);        
            char cad[]=in.next().toCharArray();
            int prefix=0;
            int sufix=cad.length;            
            while(prefix!=cad.length)
            {
                if(cad[prefix]=='a')
                    prefix++;
                else
                    break;
            }
            if(prefix==sufix)
               System.out.println(String.copyValueOf(cad).substring(0,sufix-1)+"z");
            else
            {
                sufix=prefix+1;               
                cad[sufix-1]=(char)(cad[sufix-1]-1);
                while(sufix!=cad.length)
                {
                    if(cad[sufix]!='a'){
                        cad[sufix]=(char)(cad[sufix]-1);
                        sufix++;
                    }
                    else
                        break;
                }                 
                System.out.println(cad);
            }          
        
    }    
}
