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 A708 {
	public static char shift(char x) {
		if (x == 'a') {
			return 'z';
		}
		else return (char) (x - 1);
	}
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		String str = scan.next();
		int n = str.length();
		
		StringBuffer ans = new StringBuffer();
		boolean inProgress = false;
		boolean done = false;
		
		for (int i = 0; i < n; i++) {
			char cur = str.charAt(i);
			if (!done && cur != 'a') {
				inProgress = true;
				ans.append(shift(cur));
			}
			else if (!done && cur == 'a' && inProgress) {
				inProgress = false;
				done = true;
				ans.append('a');
			}
			else if (!done && !inProgress && i == n - 1) {
				ans.append(shift(cur));
			}
			else {
				ans.append(cur);
			}
		}
		System.out.print(ans);
	}
}