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.
string = input()
start = False
finish = False
result = ""
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(string)):
    if not start:
        if string[i] != "a":
            result += alphabet[alphabet.find(string[i]) - 1]
            start = True
        else:
            result += "a"
    else:
        if not finish:
            if string[i] == "a":
                result += "a"
                finish = True
            else:
                result += alphabet[alphabet.find(string[i]) - 1]
        else:
            result += string[i]
if result == string:
    print(string[:-1] + "z")
else:
    print(result)