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.
'''input
aaaaaaaaaa
'''
def lexi_sum(s):
	a = "abcdefghijklmnopqrstuvwxyz"
	t = 0
	for l in s:
		t += a.index(l) + 1
	return t
def shift(s):
	a = "abcdefghijklmnopqrstuvwxyz"
	s1 = ""
	for l in s:
		s1 += a[a.index(l)-1]
	return s1
s = input()
if set(s) == set("a"):
	print(s[:-1] + "z")
	quit()
s = s.split("a")
m = s[0]
k = 1
while len(m) < 1:
	m = s[k]
	k += 1
m1 = s.index(m)
s[m1] = shift(m)
print("a".join(s))





