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()
n=len(s)
l=[]
if s.count('a')==0:
    for i in s:
        l.append(chr(ord(i)-1))
    for i in l:
        print(i,end='')
elif s.count('a')==n:
    print('a'*(n-1)+'z')
else:
    strt=0
    last=0
    for i in range(n):
        if s[i]!='a':
            strt=i
            break
    flag=0
    for i in range(strt+1,n):
        if s[i]=='a':
            last=i
            flag=1
            break
    if flag==0:
        last=n
    res=''
    for i in range(n):

        if i>=strt and i<last:
            res=res+chr(ord(s[i])-1)
        else:
            res=res+s[i]
    print(res)
