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)  {
		Scanner sc = new Scanner(System.in);
        String s=sc.nextLine();
        int j=-1,k=-1,l=-1,m=-1;
        for(int i=0;i<s.length();i++) {
        	if(s.charAt(i)!='a'){
        		if(k==-1) {
            		k=i;
        		}
        		if(i+1<s.length() && s.charAt(i+1)=='a') {
        			l=i;
        			break;
        		}
        	}
        }
        if(l==-1) {
        	l=s.length()-1;
        }
        if(k==-1) {
        	k=s.length()-1;
        }
        StringBuilder t=new StringBuilder();
        for(int i=k;i<=l;i++) {
        	char c;
        	if(s.charAt(i)=='a') {
        		c='z';
        	}
        	else {
        		c=(char) (s.charAt(i)-1);
        	}
        	t.append(c);
        }
        s=s.substring(0,k)+t+s.substring(l+1);
        System.out.println(s);
	}
}