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;

public class LettersCyclicShift {
	
	
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		
		String s = br.readLine();
		
		int index = s.length() ;
		int index2 = s.length() ;
		boolean flag = false;
		
		if(s.charAt(0) != 'a'){
			
			for (int i = 0; i <s.length() ; i++) {
				if(s.charAt(i) == 'a'){
					index = i;
					flag = true;
					break;
				}
			}
			
			String sub = s.substring(0,index);
			StringBuilder ans = new StringBuilder();
			for (int i = 0; i < sub.length(); i++) {
				ans.append((char)((int)sub.charAt(i)-1));
				
			}
			if(flag)
			System.out.println(ans.toString()+s.substring(index,s.length()));
			else
				System.out.println(ans.toString());
			
			
			
			
			
			
		}else
		{
			index = s.length()-1;
			index2 = s.length();
			boolean flag2 = false ;
			for (int i = 0; i < s.length(); i++) {
				if(!flag && s.charAt(i) != 'a'){
					index = i;
					flag = true;
				}else
					if (flag && s.charAt(i) == 'a') {
						index2 = i ;
						flag2 = true;
						break;
					}
			}
			
			String sub = s.substring(index,index2);
			
			StringBuilder ans  = new StringBuilder();
			for (int i = 0; i < sub.length(); i++) {
				
				if(sub.charAt(i) != 'a')
				ans.append((char)((int)sub.charAt(i)-1));
				else
					ans.append('z');
				
			}
			if(flag && flag2)
			System.out.println(s.substring(0,index)+ans.toString()+s.substring(index2,s.length()));
			else
				if(flag)
					System.out.println(s.substring(0,index)+ans.toString());
				else
					System.out.println(s.substring(0,s.length()-1)+'z');
			
				
		}
				
	}

}
