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.
inpt= raw_input("")

flag1= True
flag2= True

newstr= ""

for i in inpt:
    if i == "a":
        newstr= newstr+"a"

    if i != "a" and flag2== True:
        flag1= False
        newstr= newstr+ chr( ord(i)-1)

    if i=="a" and flag1== False:
        flag2= False

    if flag2==False and i !="a":
        newstr= newstr+ i

newstr1= ":"

if newstr== inpt:
    newstr1= newstr[0:len(newstr)-1] + "z"

if newstr1!= ":":
    print newstr1

else:
    print newstr
    
        

    

            
            
            
