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.
s=input()
b=''
i=0
k=0
l=0
while i<len(s) and s[i]=='a':
	
	
	i+=1
	k=i
while i<len(s) and s[i]!='a':
	b+=s[i]
	
	i+=1
	l=i
	


b1=''
for i in b:

	if ord(i)==97:
		b1+='z'
	else:
		b1+=chr(ord(i)-1)

if b1=='':
	print(s[:len(s)-1]+'z')
else:
	print(s[:k]+b1+s[l:])
