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) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		String str = scan.nextLine();
		int start = 0;
		int end = 0;
		boolean flag = false;
		if (str.charAt(0) == 'a') {
			if (str.length() == 1) {
				System.out.print('z');
			} else {
				int j = 0;
				for (; j < str.length() - 1; j++) {
					if (str.charAt(j) == 'a') {
						System.out.print('a');
					}else {
						flag = true;
						break;
					}
				}
				if(!flag && str.charAt(j) =='a') {
					System.out.print('z');
					System.exit(0);
				}
				flag = false;
				for (int i = j; i < str.length(); i++) {
					if (str.charAt(i) != 'a' && !flag) {
						System.out.print((char) (str.charAt(i) - 1));
					} else {
						flag = true;
						System.out.print(str.charAt(i));
					}
				}
			}

		} else if (str.charAt(0) != 'a') {
			for (int i = 0; i < str.length(); i++) {
				if (str.charAt(i) != 'a' && !flag) {
					System.out.print((char) (str.charAt(i) - 1));
				} else {
					flag = true;
					System.out.print(str.charAt(i));
				}
			}
		}
/*
		if (str.length() == 1 && str.charAt(0) == 'a') {
			System.out.print('z');
			System.exit(0);
		}
		for (int i = 0; i < str.length() && flag < 3; i++) {
			if (str.charAt(i) == 'a') {
				flag++;
			}
			if (flag == 1) {
				for (int j = i; j < str.length(); j++) {
					if (str.charAt(j) == 'a') {
						start = j;
						i = j;
					} else {
						break;
					}
				}
				flag++;
			} else if (flag == 3) {
				end = i;
			}
		}
		if (str.charAt(0) != 'a' && start != 0 && end != 0) {
			end = start;
			start = -1;
		}
		for (int i = 0; i < str.length(); i++) {
			if (start == 0 && end == 0) {
				System.out.print((char) (str.charAt(i) - 1));
			} else {
				if (i > start && i < end) {
					System.out.print((char) (str.charAt(i) - 1));
				} else {
					System.out.print(str.charAt(i));
				}

			}
		}
*/
	}
}
