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

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		String in = input.nextLine();
		int firstNonA = -1;

		for (int a = 0; a < in.length(); a++) {
			if (in.charAt(a) != 'a') {
				firstNonA = a;
				break;
			}
		}
		if (firstNonA == -1) {
			// special case for all A
			StringBuilder output = new StringBuilder();
			for (int a = 0; a < in.length() - 1; a++) {
				output.append('a');
			}
			output.append('z');
			System.out.println(output);
		} else {
			int shiftSize = 25;
			StringBuilder output = new StringBuilder();
			for (int a = 0; a < firstNonA; a++) {
				output.append(in.charAt(a));
			}
			int start = firstNonA;
			while (in.charAt(start) != 'a') {
				output.append((char) (in.charAt(start) - 1));
				start++;
				if (start == in.length()) {
					break;
				}
			}
			while (start != in.length()) {
				output.append(in.charAt(start));
				start++;
			}
			System.out.println(output);
		}
	}

}
