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

	static Scanner sc = new Scanner(System.in);
	static String s;
	static StringBuilder sb;
	static int i;
	static boolean flag;

	public static void main(String[] args) {
		s = sc.next();
		sb = new StringBuilder();

		rev: for (i = 0; i < s.length(); i++) {
			if (s.charAt(i) != 'a') {
				flag = true;
				for (; i < s.length(); i++) {
					if (s.charAt(i) != 'a') {
						sb.append(((char) (s.charAt(i) - 1)) + "");
					} else {
						break rev;
					}
				}
			} else
				sb.append(s.charAt(i) + "");
		}

		for (; i < s.length(); i++)
			sb.append(s.charAt(i) + "");

		if (!flag) {
			sb.replace(s.length()-1, s.length(), "z");
		}

		System.out.println(sb);

	}

}
