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 shift_letter(x):
	if (x=='a'):
		return 'z'
	else:
		return chr(ord(x)-1)

word=raw_input()
length=len(word)
ini=-1
end=-1

for i in range(length):
	char=word[i]
	if char!="a" and ini==-1:
		ini=i
	if ini!=-1 and end==-1 and char=="a":
		end=i

if end==-1:
	end=length

if ini==-1:
	res=word[0:length-1]+"z"
	print res
else:
	res=""
	for i in range(length):
		if (ini<=i and i<end):
			res+=shift_letter(word[i])
		else:
			res+=word[i]
	print res