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.

def shifts(s,ini,f):
	# print("receas",s,ini,f)
	sam=list("abcdefghijklmnopqrstuvwxyz")
	po=""
	for i in range(ini,f+1):
		po+=sam[(sam.index(s[i])+25)%26]
	# print("po=",po)
	return s[:ini]+po+s[f+1:]


s=input().strip()
inindex=0
ans=""
if(s[0]=='a'):
	for i in range(len(s)):
		if(s[i]!="a"):
			inindex=i
			break
	# print(inindex)
	if(inindex==0):
		ans=shifts(s,len(s)-1,len(s)-1)
	else:
		po=0
		if(s[inindex:].__contains__("a")):
			po=inindex+s[inindex:].index("a")
		else:
			po=len(s)
		# print(po)
		ans=shifts(s,inindex,po-1)
else:
	po=0
	if(s.__contains__("a")):
		po=s.index("a")-1
	else:
		po=len(s)-1
	ans=shifts(s,0,po)
print(ans)
 	  			          		    	   	 		