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

public class Main
{
    static boolean onlySingleLetter(String ss,char ch){
        for(int i=0;i<ss.length();i++){
            if(ss.charAt(i)!=ch) return false;
        }
        return true;
    }
    
	public static void main (String[] args) throws java.lang.Exception
	{
	    Scanner sc = new Scanner(System.in);
	    String s = sc.next();
	    char[] arr = s.toCharArray();
	    boolean done = false;
	    char cc = 'a';
	    if(onlySingleLetter(s,cc)){
	        arr[s.length()-1] = 'z';
	    }
	    
	    else
	    for(int i=0;i<arr.length;i++){
	        if(done && s.charAt(i)=='a') break;
	        else if(s.charAt(i)!='a'){
	            arr[i]--;
	            done = true;
	        }
	    }
	    
	    String res = new String(arr);
	    System.out.println(res);
	}
}
