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.
import os


def transfer(s):
	ans = ''
	for x in s:
		ans += chr(ord(x)-1)
	return ans

ans = ''
s = raw_input().strip()
st = -1
ed = -1
ll= len(s)
for i in xrange(len(s)):
	cur = s[i]
	if cur != 'a' and st == -1:
		st = i
	if cur == 'a' and st!=-1 and ed == -1:
		ed = i-1
		break
#all aaaa		
if st == -1:
	ans = (ll-1)*'a'+'z'
else:
	#no a at end
	if ed == -1:
		ed = ll-1
	transfer_s = transfer(s[st:ed+1])
	ans = s[:st]+transfer_s+s[ed+1:]
print ans
