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;

public class biscuit2 {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		java.io.BufferedReader dd = new BufferedReader(new java.io.InputStreamReader(System.in));
		String a = dd.readLine();
		int n = a.length();
		//System.out.println(a);
		char ch[] = a.toCharArray();
		boolean kabotasaki;
		int p=10;
		int count=0;
		boolean eh=false;
		int t=0;
		for(int i=0;(i<ch.length)&& p>0;i++){
			if(a.length()==1){
				char lol = ch[i];
				int hehe = (lol)-1;
				if(hehe==96){
					hehe=122;
					lol = (char)122;
				}
				else{
					lol = (char)hehe;
				}
				
				ch[i] = lol;
				eh = true;
				count++;
				
			}
			else{
				if(i==0){
					if(ch[i]=='a'){
						continue;
					}
					else{
						char lol = ch[i];
						int hehe = (lol)-1;
						if(hehe==96){
							hehe=122;
							lol = (char)122;
						}
						else{
							lol = (char)hehe;
						}
						
						ch[i] = lol;
						p++;
						t++;
						count++;
					}
					
				}
				else{
				if(ch[i]!='a'  && p>0){
					
					char lol = ch[i];
					int hehe = (lol)-1;
					if(hehe==96){
						hehe=122;
						lol = (char)122;
					}
					else{
						lol = (char)hehe;
					}
					
					ch[i] = lol;
					t++;
				count++;
				}
				else{
					if(t>0){
						p=-100;
					}
				}
				
			}
			}
		}
		if(count==0 && eh == false){
			char lol = ch[n-1];
			int hehe = (lol)-1;
			if(hehe==96){
				hehe=122;
				lol = (char)122;
			}
			else{
				lol = (char)hehe;
			}
			
			ch[n-1] = lol;
		}
		String b = String.valueOf(ch);
		System.out.println(b);
	}


}
