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 shift(c):
    if c[0] == 'a':
        return 'z'
    return chr(ord(c[0]) - 1)


def main():
    s = list(input())
    n = len(s)

    found = False
    for i in range(0, n):
        if s[i] > shift(s[i]):
            for j in range(i, n):
                if s[j] >= shift(s[j]):
                    s[j] = shift(s[j])
                else:
                    break
            found = True
            break

    if not found:
        s[n - 1] = shift(s[n - 1])

    print("".join(s))

main()