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.*;
public class c {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		String s = in.next();
		char[] arr = s.toCharArray();
		int n = s.length();
		
		StringBuilder sb = new StringBuilder();
		char a = 'a';
		int start = 0;
		for (int i = 0; i < n; i++) {
			if (arr[i] != a) {
				start = i;
				break;
			}
		}
		String sub = s.substring(start + 1, n);
		int stop = sub.indexOf(a);
		if (stop == -1) {
			stop = n;
		} else {
			stop += start + 1;
		}
		
		// check for all a's
		boolean alla = true;
		for (int i = 0; i < n; i++) {
			if (arr[i] != 'a') {
				alla = false;
			}
		}
		if (alla) {
			for (int i = 0; i < n - 1; i++) {
				sb.append('a');
			}
			sb.append('z');
		} else {
			for (int i = 0; i < start; i++) {
				sb.append(arr[i]);
			}
			for (int i = start; i < stop; i++) {
				int c = arr[i];
				c--;
				sb.append((char)c);
			}
			for (int i = stop; i < n; i++) {
				sb.append(arr[i]);
			}
		}
		
		System.out.println(sb);
	}

}
