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 move(s):
    new_s = ''
    for i in range(len(s)):
        new_s += chr(ord(s[i]) - 1)
    return new_s


s = input()
st = -1
fi = -1
for i in range(len(s)):
    if st == -1 and s[i] != 'a':
        st = i
    elif st != -1 and s[i] == 'a':
        fi = i
        break
if st != -1 and fi != -1:
    print(s[:st], move(s[st:fi]), s[fi:], sep='')
elif st != -1 and fi == -1:
    print(s[:st], move(s[st:]), sep='')
elif st == -1 and fi == -1:
    print(s[:-1], 'z', sep='')