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.
import sys

# sys.stdin = open("c.txt", "r")


def dec(c):
    if c == "a":
        return "z"
    return chr(ord(c) - 1)


s = raw_input()
started = False
end = False
r = ""
if s[0] != 'a':
    started = True
for i in range(len(s)):
    if started:
        if s[i] == 'a':
            r += s[i]
            end = True
        elif not end:
            r += dec(s[i])
        else:
            r += s[i]
    else:
        if i == len(s) - 1:
            r += dec(s[i])
        else:
            if s[i] != 'a':
                r += dec(s[i])
                started = True
            else:
                r += s[i]

print r
