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

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		String word = scn.nextLine();
		scn.close();
		char[] arr = word.toCharArray();
		int i = 0;
		int counter = -1;
		while (i < word.length()) {
			if (arr[i] == 'a') {
				counter++;
			}
			if (arr[i] == 'a' && i != counter) {
				break;
			} else {
				if (arr[i] != 'a') {
					arr[i]--;
				}
			}
			i++;
		}
		if (counter == word.length() - 1) {
			arr[word.length() - 1] = 'z';
			System.out.println(String.valueOf(arr));
		} else {
			System.out.println(String.valueOf(arr));
		}
	}
}
