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 LettersCyclicShift {
	
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		String s = sc.next();
		int n = s.length();
		
		boolean done = false;
		
		StringBuilder sb = new StringBuilder();
		
		int i=0;
		while(i<n && s.charAt(i)=='a')
			sb.append(s.charAt(i++));
		
		while(i<n)
		{
			done = true;
			if(s.charAt(i)== 'a')
				break;
			sb.append((char)(s.charAt(i)-1));
			i++;
		}
		String ans = "";
		if(!done)
		{
			ans = sb.toString().substring(0, sb.length()-1);
			ans = ans+'z';
		}
		else
		{
			ans = sb.toString();
			ans+=(s.substring(i));
		}
		System.out.println(ans);
		
		
	}

}
