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.
st = input()
st1 = ""
others = False
length = len(st)
for i in range(0, length):
    if i == length - 1 and others is False:
        st1 += str(chr(((ord(st[i]) - 98) % 26) + 97))
        break
    if st[i] == 'a':
        if others is True:
            st1 += st[i:length]
            break
        st1 += str(st[i])
    else:
        others = True
        st1 += str(chr(ord(st[i]) - 1))
print(st1)
