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.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeSet;

public class tmp {
	public static void main(String[] Args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		boolean found = false;
		int n = s.length();
		for (int i = 0; i < n && !found; i++)
			if (s.charAt(i) != 'a') {
				for (int j = 0; j < i; j++)
					System.out.print('a');
				while (i < n && s.charAt(i) != 'a')
					System.out.print((char)(s.charAt(i++) - 1));
				while (i < n)
					System.out.print(s.charAt(i++));
				found = true;
			}
		if (!found)
			System.out.println(s.substring(0, n - 1) + 'z');
	}
}