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 LetterCyclicShift {
	public static void main(String[] args) {
		String s;
		Scanner sc = new Scanner(System.in);
		s = sc.next();
		int start = 0;
		int end = s.length();
		int first = -1;
		for (int i = 0; i < end; ++i) {
			if (s.charAt(i) == 'a') {
				first = i;
				break;
			}
		}
		if (first == 0) {
			int i = 1;
			while (i < end && s.charAt(i) == 'a') {
					i++;
			}

			if (i == end) {
				start = end = end - 1;
			} else {
				start = i;
				for (int j = start + 1; j < end; ++j) {
					if (s.charAt(j) == 'a') {
						end = j - 1;
						break;
					}
				}


			}
		} else if (first == -1) {
			end = s.length();
		} else {
			end = first - 1;
		}

		StringBuilder shiftedString = new StringBuilder();
		for (int i = 0; i < s.length(); ++i) {
			if (i >= start && i <= end) {
				char newChar = (s.charAt(i) == 'a') ? 'z' : (char)((int)(s.charAt(i)) - 1);
				shiftedString.append(newChar);
			} else {
				shiftedString.append(s.charAt(i));
			}
		}

		System.out.println(shiftedString.toString());
	}
}