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.
# your code goes here
s = raw_input().strip()
l = 0
res = ""
while l < len(s) and s[l] == 'a':
	res += s[l]
	l+=1

while l < len(s) and s[l] != 'a':
	j = ord(s[l])
	j-=1
	res+=chr(j)
	l+=1
while l < len(s):
	res+=s[l]
	l+=1
if s == res:
	p1 = s[0:len(s)-1]
	p2= s[-1]
	j = ord(p2)
	j-=1
	j+=26
	p1+=chr(j)
	print p1
else:
	print res