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 Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		String s = sc.next();
		System.out.println(solve(s));

		sc.close();
	}

	static String solve(String s) {
		int beginIndex = 0;
		while (beginIndex < s.length() && s.charAt(beginIndex) == 'a') {
			beginIndex++;
		}

		if (beginIndex == s.length()) {
			return String.format("%sz", s.substring(0, s.length() - 1));
		}

		int endIndex = beginIndex;
		while (endIndex < s.length() && s.charAt(endIndex) != 'a') {
			endIndex++;
		}

		return String.format("%s%s%s", s.substring(0, beginIndex),
				s.substring(beginIndex, endIndex).chars().mapToObj(ch -> (char) (ch - 1))
						.collect(StringBuilder::new, StringBuilder::append, StringBuilder::append).toString(),
				s.substring(endIndex));
	}
}
