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

if len(s)==s.count("a"):
    r=s[:-1]
    r+="z"
    print(r)
else:
    b=0
    for i in range(len(s)):
        if s[i]!="a":
            b=i
            break

    r=""
    r+=s[:b]
    for i in range(b,len(s)):
        if s[i]=="a":
            y="z"
        else:
            x=ord(s[i])
            y=chr(x-1)
        if y>s[i]:
            r+=s[i:]
            break
        else:
            r+=y
    print(r)