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.*;
import java.math.BigInteger;
import java.util.*;
public class Temp {
	static final BigInteger ten = new BigInteger(10+"");
	public static void main(String[] args) throws Throwable {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		char[] arr = br.readLine().toCharArray();
		boolean flag = false;
		for(int i = 0;i<arr.length;i++)
		{
			char c = arr[i];
			if(c=='a')
			{
				if(flag)
				{
					break;
				}
				else
				{
					continue;
				}
			}
			arr[i] = (char) (c-1);
			flag = true;
		}
		if(!flag)
			arr[arr.length-1] = 'z';
		for (int i = 0; i < arr.length; i++) {
			out.append(arr[i]);
		}
		out.flush();
	}
}