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.*;
public class solution   
{    
public static void main (String args[])   
{   int max=Integer.MAX_VALUE;
	Scanner sc=new Scanner(System.in);
	String st=sc.nextLine();
	char[] ar=st.toCharArray();
	int flag =0;
	for(int i=0;i<ar.length;i++)
	{ //System.out.print(ar[i]+" ");
		if(i==0&&ar[i]=='a')
		{
			flag=1;
			continue;
			
		}
			
		else
		{//System.out.print('r');
			
			if(ar[i]=='a')
			{ 	if(flag==1)
					continue;
				else	
				{
					flag=0;
					break;
				}
			}
			else
			{	flag=0;
		
				//char ab=ar[i];
				 ar[i]=(char)((char)ar[i]-1);
				//System.out.println(ar[i]);
			}
		}
		
	}
	if(flag==1)
	{
		ar[ar.length-1]='z';
		for(int i=0;i<ar.length;i++)
			System.out.print(ar[i]);
	}
	else
	for(int i=0;i<ar.length;i++)
	System.out.print(ar[i]);
	
	
}
	
}    