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.IOException;
import java.util.Arrays;
import java.util.Scanner;

public class ProblemA {
	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) throws IOException {
		String s = sc.next();
		int n = s.length(), a[] = new int[n], tmp = 0;
		boolean check = false;
		for (int i = 0; i < n; i++)
			a[i] = s.charAt(i) - 'a';
		int b[] = a.clone();
		for (int i = 0; i < n; i++) {
			tmp = a[i] - 1;
			if (tmp == -1)
				tmp = 26;
			if (a[i] > tmp) {
				b[i] = tmp;
				check = true;
			} else if (check)
				break;
		}
		check = true;
		for(int i = 0 ; i < n ; i ++)
			if(a[i]!=b[i]){
				check = false ;
				break ;
			}
		
		if (check) {
			for (int i = 0; i < n - 1; i++)
				System.out.print((char) (a[i] + 'a'));
			System.out.println(a[n - 1] == 0 ? 'z' : (char) (a[n - 1] + 'a' - 1));
		} else
			for (int i = 0; i < n; i++)
				System.out.print((char) (b[i] + 'a'));

	}

}