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.BufferedReader ;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays; 


public class codeforce {
	public static void main(String[] args){
		BufferedReader br  = new BufferedReader(new InputStreamReader(System.in)) ; 
		try {
			String s = br.readLine() ;
			char[] chars = s.toCharArray()  ;
			int start = -1 ; 
			int end = -1 ;
			for (int i= 0 ; i < chars.length ; i ++){
				if (start != -1){
					if (chars[i] - 'a' == 0 ){
						end  = i-1 ; 
						break ; 
					}
				}else {
					if (chars[i]-'a' != 0){
						start = i  ;
					}
				}
			}
			if (start != -1){
				if (end == -1){
					end =  chars.length-1 ;
				}
			}
			//System.out.println(start);
			//System.out.println(end);
			String ans ; 
			if (start != -1){
			for (int i = start ; i < end+1 ; i++){
				chars[i]-- ; 
			}
			}else {
				chars[chars.length-1] += 25 ;
			}
			ans = new String(chars) ; 
			System.out.println(ans);
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}
}