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.*;
import java.util.*;

public class Solution{ 

	
 public static void main(String[] args) {
     
     Scanner in = new Scanner(System.in);
     
     int n,i,firstnona=-1,firsta;
     boolean nona_trigger=false;
     char[] a;
     
     a=in.next().toCharArray();
     n=a.length;
     firsta=n;
     
     for(i=0;i<n;i++){
    	 if(!nona_trigger){
    		 if(a[i]!='a'){
    			 firstnona=i;
    			 nona_trigger=true;
    		 }
    	 }
    	 if(nona_trigger){
    		 if(a[i]=='a'){
    			 firsta=i;
    			 break;
    		 }
    	 }
     }
     
     if(!nona_trigger){
    	 a[n-1]='z';
     }
     else {
    	 for(i=firstnona;i<firsta;i++){
    		 a[i]=(char)(a[i]-1);
    	 }
     }
     
     for(i=0;i<n;i++)System.out.print(a[i]);
    	 
     
     
 }
}