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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class problem_0708A {
	public static void main(String[] args) throws IOException{
		BufferedReader br=new BufferedReader
				(new InputStreamReader(System.in));
		
		char[] S = br.readLine().toCharArray();
		int i;
		for(i = 0; i < S.length; i++){
			if(S[i] != 'a') break;
		}
		int changes = 0;
		while(i < S.length){
			S[i]--;
			changes++;
			if(i+1 >= S.length || S[i+1] == 'a') break;
			i++;
		}
		if(changes == 0) S[S.length-1] = 'z';
		System.out.println(String.copyValueOf(S));
	}
}
