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 C {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		char[] arr = in.next().toCharArray();
		char[] abc = new char[26];
		for (int i =0 ; i < 26; i++)
			abc[i] = Character.toChars('a'+i)[0];
		int l = -1; int r = arr.length-1;
		for (int i = 0; i <= r; i++) {
			if (arr[i] != 'a') {
				l = i;
				break;
			}
		}
		for (int i = l+1; i <= r; i++) {
			if (arr[i] == 'a') {
				r = i-1;
				break;
			}
		}
		for (int i = 0; i < arr.length; i++) {
			if (i == arr.length-1 && l == -1)
				System.out.println(abc[(arr[i]-'a'-1 + 26)%26]);
			else if (i <= r && i >= l)
				System.out.print(abc[(arr[i]-'a'-1 + 26)%26]);
			else
				System.out.print(arr[i]);
		}
	}
}
