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.
a=list(input())
b=[]
l=len(a)
count=0
c=[]
if a[0]!='a':
    for i in range(l):
        if a[i]!='a':
             b.append(chr(ord(a[i])-1))
        else:break     
    if a[i]=='a':
        b+=a[i:]
    print(''.join(b)) 
elif a.count('a')!=l:
    for i in range(l):
        if a[i]!='a':
            b.append(chr(ord(a[i])-1))
            count=1
            c.append(i)
        if count==1 and a[i]=='a':
            break
    a[c[0]:c[-1]+1]=b  
    print(''.join(a))
        
else :
    print('a'*(l-1)+'z')