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 Letters_Cyclic_Shift {
public static void main(String[] args) throws IOException{
	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	String str=br.readLine();
	int other=0,a=0;
	for(int i=0;i<str.length();i++){
		if(str.charAt(i)!='a'){
			other=i;
			break;
		}
	}
	for(int i=0;i<str.length();i++){
		if(str.charAt(i)=='a'){
			a++;
		}
	}
	StringBuffer sb=new StringBuffer(str.length());
	if(a==str.length()){
		for(int i=0;i<str.length()-1;i++){
			sb.append(str.charAt(i));
		}
		sb.append('z');
		for(int i=0;i<str.length();i++)
			System.out.print(sb.charAt(i));
			}
	else{
		for(int i=0;i<other;i++){
			sb.append('a');
		}
		int count=0;
		for(int i=other;i<str.length();i++){
			if(str.charAt(i)!='a'){
				char c=(char) ((int)(str.charAt(i))-1);
				sb.append(c);
			}	
			else{
				count=i;
				break;
			}
		}
		for(int i=count;i<str.length();i++){
			sb.append(str.charAt(i));
		}
		for(int i=0;i<str.length();i++)
		System.out.print(sb.charAt(i));
	}
}
}
