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

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner input = new Scanner(System.in);
		
		String t;
		t = input.nextLine();
		
		StringBuilder s = new StringBuilder(t); 
		
		int start = 0;
		int end = 0;
		StringBuilder temp = new StringBuilder("");
		int t1 = 0;
		int t2 = 0;
		boolean flag = true;
		for(int i = 0; i < s.length(); i++) {
			
			if(s.charAt(i) != 'a') {
				start = i;
				flag = false;
				end = s.indexOf("a", start + 1);
				if(end == -1) {
					end = s.length();
				}
					temp.append(s.substring(start, end));
					t1 = start;
					t2 = end;
					break;
				
			}
		}

		if(flag) {
			temp = s;
			
			
		}
		
		String ans = "" ;
		StringBuilder ss = new StringBuilder(ans);
		start = 0;
		for(int i = 0; i < temp.length(); i++) {
			start = temp.charAt(i);
			if((char) start == 'a' && i == temp.length()-1) {
				ss.append('z');
			}
			else if((char) start != 'a') {
				start--;
				ss.append((char)start);
			}
			else {
				ss.append((char)start);
			}
			
			
		}
		if(flag) {
			temp = ss;
			
		}
		else {
			temp.delete(0, temp.length());
			temp.append(s.substring(0, t1) + ss + s.substring(t2, s.length()));
		}
		System.out.println(temp);
		
		
		
		
		
		
		
		
	}

}
