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 void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String s = in.next();
		int cur = 0;
		if (alla(s)) {
			for (int i = 0; i < s.length() - 1; ++i) System.out.printf("%c", s.charAt(i));
			System.out.printf("z");
		}
		else for (int i = 0; i < s.length(); ++i) {
			if (cur == 0 && s.charAt(i) != 'a') cur = 1;
			if (cur == 1 && s.charAt(i) == 'a') cur = 2;
			if (cur == 1) System.out.printf("%c", s.charAt(i) - 1);
			else System.out.printf("%c", s.charAt(i));
		}
		System.out.printf("\n");
		in.close();
	}
	public static boolean alla(String s) {
		for (int i = 0; i < s.length(); ++i) if (s.charAt(i) != 'a') return false;
		return true;
	}
}
