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;
import java.io.PrintWriter;

public class C {

	
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		
		String s = in.readLine();
		boolean done = false;
		int count = 0;
		for (int i = 0; i < s.length() - 1; i++) {
			if(done){
				sb.append(s.charAt(i));
				continue;
			}
			
			if(s.charAt(i) != 'a' || count == 0){
				if(s.charAt(i) == 'a'){
					sb.append(s.charAt(i));
				}
				else{
					count++;
					sb.append((char) (s.charAt(i) - 1));					
				}
			}
			else{
				done = true;
				sb.append(s.charAt(i));
			}
		}
		
		if(count == 0){
			if(s.charAt(s.length() - 1) != 'a')
				sb.append((char) (s.charAt(s.length() - 1) - 1));
			else
				sb.append('z');
		}
		else{
			if(s.charAt(s.length() - 2) == sb.charAt(sb.length() - 1))
				sb.append(s.charAt(s.length() - 1));
			else{
				if(s.charAt(s.length() - 1) != 'a')
					sb.append((char) (s.charAt(s.length() - 1) - 1));
				else
					sb.append('a');
			}
		}
		
		System.out.println(sb);
	}
}
