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.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Scanner;

public class Main {

	private static char[] string;

	public static void main(String[] args) throws IOException {
		//System.setIn(new FileInputStream(new File("data.in")));
		Scanner scanner = new Scanner(System.in);

		string = scanner.nextLine().toCharArray();

		int position = 0;

		boolean allAs = true;
		for (int it = 0; it < string.length; ++it) {
			allAs = allAs && (string[it] == 'a');
		}

		if (allAs) {
			for (int it = 0; it < string.length - 1; ++it)
				System.out.print('a');
			System.out.print('z');
		} else {
			while (position < string.length && string[position] == 'a')
				System.out.print(string[position++]);
			while (position < string.length && string[position] != 'a')
				System.out.print((char) (string[position++] - 1));
			while (position < string.length)
				System.out.print((char) (string[position++]));
		}

		if (scanner != null) {
			scanner.close();
		}

	}

}