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

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String s = bf.readLine();
		StringBuilder ans = new StringBuilder();
		int i = 0;
		for(int size = s.length()-1; i < size && s.charAt(i)=='a'; ++i) ans.append("a");
//		System.out.println(ans);
		boolean flag = true;
		if(i==s.length()-1 && s.charAt(i)=='a') flag = false;
		boolean stop = false;
		for(int size = s.length(); flag && i<size; ++i)
		{			
			char c = s.charAt(i);
			if(c=='a') stop = true;
			if(!stop) ans.append((char)(c-1)); else ans.append(c);
		}
		if(flag) System.out.println(ans); else{ans.append("z"); System.out.println(ans);}
		
	}
}
