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 = input()


def solve(s):
    for start_idx, ch in enumerate(s):
        if ch != 'a':
            break
    else:
        return s[:-1] + 'z'

    for end_idx, ch in zip(range(start_idx + 1, len(s)), s[start_idx + 1:]):
        if ch == 'a':
            break
    else:
        end_idx = len(s)

    tr = str.maketrans(
        "".join([chr(ord('a') + i) for i in range(26)]),
        "".join([chr(ord('a') + (i + 25) % 26) for i in range(26)]))

    result = s[:start_idx] + s[start_idx:end_idx].translate(tr) + s[end_idx:]
    return result


print(solve(s))
