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.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;
public class Solution{
	public static void main(String[] args){
		try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))){
			char[] word = in.readLine().toCharArray();
			boolean flag = false;  // if i had taken a substring or not yet
			for(int i=0;i<word.length;i++){
				if(word[i]!='a'){
					word[i] = (char)(word[i]-1);
					flag = true;
				}else if(flag){
					break;
				}
			}
			if(!flag) word[word.length-1] = 'z';
			System.out.println(word);
		}catch(IOException e){
			
		}
	}
}