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.*;
import java.io.*;
public class a{
public static void main(String[]args)throws Exception{
  //  File f=new File("/home/ujjwal/Desktop/hi.txt");
Scanner sc=new Scanner(System.in);
String s=sc.next();char array[]=s.toCharArray();
int arr[]={0,s.length()-1},c=0;//aaaabbbbabaaba   codeforces

int j=1000000000;
for(int i=0;i<array.length;i++){
if(array[i]!='a'){
array[i]=(char)(array[i]-1);j=i;c=1;
}
else if(array[i]=='a' && j<i)
break;
}
if(c==0)
array[array.length-1]='z';
for(int i=0;i<array.length;i++){
System.out.print(array[i]);
}
}


}


