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

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		char[] in = scan.next().toCharArray();
		if(new String(in).matches("a*")){
			for(int i = 0; i < in.length-1; i++){
				System.out.print("a");
			}
			System.out.print("z");
			return;
		}
		outer: for(int i = 0; i < in.length; i++){
			if(in[i] == 'a') continue;
			else{
				for(; i < in.length; i++){
					if(in[i] == 'a') break outer;
					else in[i]--;
				}
			}
		}
		System.out.println(new String(in));
	}

}
