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 LCS {
    
    public static void main(String[] args) {
        
        Scanner scan = new Scanner(System.in);
        String in = scan.next();
        int firstNotA = 0;
        while(firstNotA<in.length()){
            if(in.charAt(firstNotA)!='a'){
                break;
            }
            else{
                firstNotA++;
            }
        }
        if(firstNotA==in.length()) {
            System.out.println(in.substring(0, in.length()-1)+"z");
        }
        else{
            StringBuilder sb = new StringBuilder();
            for(int i=0; i<firstNotA; i++) {
                sb.append('a');
            }
            for(int i=firstNotA; i<in.length(); i++) {
                if(in.charAt(i)!='a'){
                    sb.append((char)(in.charAt(i)-1));
                }
                else{
                    for(int j=i; j<in.length(); j++) {
                        sb.append(in.charAt(j));
                    }
                    break;
                }
            }
            
            System.out.println(sb.toString());
        }
        
        
    }
    
    
}