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 test{
	public static void main(String[] args)
	{
		int count=0,x,count1=0;
		Scanner scan=new Scanner(System.in);
		String b=scan.next();
		char[] a=new char[b.length()+1];
		a=b.toCharArray();
		
		for(x=0;x<b.length();x++)
		{
			if(a[x]=='a')
				count1++;
		}
		if(count1==b.length())
			a[b.length()-1]='z';
		else{
		for(x=0;x<b.length();x++)
			{
				if(a[x]!='a')
				{
					a[x]=(char)((int)a[x]-1);
					count++;
				}
				
				if(x==b.length()-1)
					break;
				if(a[x+1]=='a' && count!=0)
					break;
					
			}
			
		}
		b=new String(a);
		System.out.println(b);
		
		
	}
}
