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.Scanner;

public class LittleCycleShift {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner input = new Scanner(System.in);
		String s  = input.next();
		int i=0;
		while(i<s.length() && s.charAt(i)=='a')i++;
		if(i==s.length()){
			for(int j=0; j<s.length()-1;j++)System.out.print('a');
			System.out.print('z');
			return;
		}
		int index1 = i;
	    i++;
	    while(i<s.length() && s.charAt(i)!='a')i++;
	    System.out.print(s.substring(0,index1));
	    for(int j=index1; j<i;j++){
	    	System.out.print((char)(s.charAt(j)-1));
	    }
	    System.out.print(s.substring(i));
	}

}
