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.util.*;
import java.text.*;
import java.lang.*;
public class AimTechC {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in=new Scanner(System.in);
		String a=in.nextLine();
		long n=a.length(),f=0;
		char s[]=a.toCharArray();
		for(int i=0;i<n;i++)
		{  char c=s[i];
			if(c!='a') {s[i]--; f=1; }
			else if(c=='a' && f==1) break; 
		}
		if(f==0) 
		{ for(int i=0;i<n-1;i++) System.out.print(s[i]);
			System.out.println('z');
		}
		else System.out.println(s);
	}

}
