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 CF709C {
	public static void main(String[] args) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String giv = br.readLine();
		StringBuilder sb = new StringBuilder();
		int count = 0;
		int i=0;
		for(i=0;i<giv.length();i++)
		{
			if(giv.charAt(i)=='a')
			{
				if(count==1)
					break;
				sb.append("a");
			}
			else
			{
				char toBeAppended = giv.charAt(i);
				toBeAppended--;
				sb.append(toBeAppended);
				count=1;
			}
		}
		if(count==1)
		{
			sb.append(giv.substring(i));
		}
		if(giv.charAt(0)=='a'&&giv.length()==1)
			System.out.println("z");
		else if(giv.equals(sb.toString()))
		{
			System.out.println(giv.substring(0,giv.length()-1)+"z");
		}
		else
			System.out.println(sb.toString());
	}
}
