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()
N = len(S)
if N == 1:
    if S == "a":
        print("z")
    else:
        c = chr(ord(S) - 1)
        print(c)
    exit()
start = -1
stop = -1
for i, s in enumerate(S):
    if start == -1 and s != "a":
        start = i
        continue
    if start != -1 and s == "a":
        stop = i - 1
        break
if start == -1:
    # last -> z
    ans = list(S)
    ans[-1] = "z"
    print("".join(ans))

    exit()
if stop == -1:
    stop = N - 1
# print(start, stop)
ans = ""
for i, s in enumerate(S):
    c = s
    if start <= i <= stop:
        c = chr(ord(s) - 1)
    ans += c
print(ans)
