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 C {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String s = scan.nextLine();
		int b = 0, e = s.length() - 1;
		int i = 0;
		while(i < s.length() && s.charAt(i++) == 'a')
			b = i;
		i--;
		while(i < s.length() && s.charAt(i++) != 'a')
			e = i;
		
		//System.out.println(b + " " + e + " ");
		if(b > e)
			System.out.println(s.substring(0, s.length() - 1) + "z");
		else
			System.out.println(s.substring(0, b) + shift(s.substring(b, e)) + s.substring(e, s.length()));		
	}
	
	static String shift(String s){
		char[] charS = s.toCharArray();
		for (int i = 0; i < charS.length; i++) {
			charS[i] = (char)(charS[i] - 1);
		}
		s = new String(charS);
		return s;
	}

}
