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.
def sh(c):
    a=ord(c)
    return chr(a-1)
    
s=str(input())
l=list(s)
x=l.count('a')
if x==0:
    for i in range(len(l)):
        l[i]=sh(l[i])
    print(''.join(l))
elif x==len(l):
    l[-1]='z'
    print(''.join(l))
elif x==1:
    a=l.index('a')
    if a==0:
        for i in range(1,len(l)):
            if l[i]=='a':
                break
            l[i]=sh(l[i])
        print(''.join(l))
    else:
        for i in range(a):
            l[i]=sh(l[i])
        print(''.join(l))
else:
    l1=[]
    flag1=False
    flag2=False
    for i in range(len(l)):
        if flag1==True and l[i]=='a':
            flag2=True
        if l[i]!='a' and flag2==False:
            l[i]=sh(l[i])
            flag1=True
    print(''.join(l))
        