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.
s = [ord(i) for i in input()]
if s.count(97) == 0:
    for i in range (len(s)):
        s[i] -= 1
elif s.count(97) == len(s):
    s[-1] = 122
else:
    index = s.index(97)
    if index == 0:
        s.append(97)
        for i in range (len(s)):
            if s[i] != 97:
                for j in range (i, len(s)):
                    if s[j] == 97:
                        for k in range (i, j):
                            s[k] -= 1
                        break
                break
        s.pop(-1)
    else:
        hasta = 0
        for i in range (len(s)):
            if s[i] == 97:
                for j in range (i):
                    s[j] -= 1
                break
for i in range (len(s)):
    s[i] = chr(s[i])
print("".join(s))
		   	 	 	  	  	   	     	  		