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=list(input())
count=0
count1=0
y=0
if s.count('a')==len(s):
    print('a'*(len(s)-1)+'z')
elif s[0]!='a' or s[1]!='a':
    for i in range(len(s)):
        if s[i]=='a' and i!=0:
            count=1
            print('a',end='')
            break
        elif s[i]=='a' and i==0:
            print('a',end='')
        else:
            print((chr(ord(s[i]) - 1)),end='')
    if count==1:
        for i in range(i+1,len(s)):
            print(s[i],end='')
else:
    for i in range(len(s)):
        if s[i]=='a':
            print('a',end='')
            count1+=1
        else:
            break
    for j in range(i,len(s)):
        if s[j]!='a':
            print(chr(ord(s[j])-1),end='')
            count1+=1
        else:
            break
    for i in range(j,len(s)):
        if count1<len(s):
            print(s[i],end='')
    
        