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


public class HelloWorld{
    
    public static void main(String args[])
    {
        
        Scanner s= new Scanner(System.in);
        
     
        char arr[]=s.nextLine().toCharArray();
        
        int flag=0;
        int flag2=0;
        
        outer: for(int i=0;i<arr.length;i++)
        {
            if(arr[i]!='a')
            {
                flag=1;
                arr[i]=(char)(arr[i]-1);
                for(int j=i+1;j<arr.length;j++)
                {
                    if(arr[j]=='a')
                    break outer;                        
                    arr[j]=(char)(arr[j]-1);
                }
                break outer;
            }
            
        }
        
        
        if(flag==0)
        {
            
         arr[arr.length-1]='z';   
        }
     
        System.out.println(String.valueOf(arr));
    }
    
}