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.Scanner;

public class Problem708A {

    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        String s  = sc.nextLine();
        String s1="";
        int cnt=0;
        boolean flag=false;
        int cntA=0;
        char arr[] = s.toCharArray();
        int i=0;
        StringBuilder sb =  new StringBuilder();
        for(char x:s.toCharArray()){
            //System.out.println(cnt);
            int ascii = (int)x;
            if(ascii!=97 && !flag && cnt!=Integer.MAX_VALUE){
                sb = sb.append((char)(x-1));
              //  s1 = s1+(char)(x-1);
                cnt=cnt+2;
            }else if(ascii==97){
                if(cnt==0 || cnt==1){
                    cnt=1;
                }else{
                    cnt=Integer.MAX_VALUE;
                }
                sb = sb.append(x);
                flag=true;
            }else if(ascii!=97 && flag && cnt!=Integer.MAX_VALUE){
                sb = sb.append((char)(x-1));
               // s1 = s1+(char)(x-1);
                cnt=cnt+2;
            }else if(ascii!=97 && flag && cnt==Integer.MAX_VALUE){
                sb = sb.append(s.substring(i,s.length()));
                //s1 = s1+s.substring(i,s.length());
                break;
            }

            if(x=='a'){
                cntA++;
            }
            i++;
        }
        if(cntA==s.length()){
            s=s.substring(0,s.length()-1)+'z';
            System.out.println(s);
        }else {
            System.out.println(sb.toString());
        }
    }
}
