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

start = -1
end = -1
for i in range(len(s)):
    if s[i] != 'a':
        if start < 0:
            start = i
            end = i
        else:
            end = i
    if s[i] == 'a' and start >= 0:
        break

if start < 0:
    print(s[0:len(s)-1], end="")
    print('z')
else:
    for i in range(len(s)):
        if start <= i <= end:
            if s[i] == 'a':
                print('z', end="")
            else:
                print(chr(ord(s[i]) - 1), end="")
        else:
            print(s[i], end="")



