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().split('a')
ma=1000000000000
R='abcdefghijklmnopqrstuvwxyz'
for x in S :
    if len(x)>0 :
        ma=len(x)
        break
S1=''
c=1
p=len(S)
for x in S :
    if len(x)==ma and c==1 :
        c=0
        for i in range(len(x)) :
            S1=S1+R[R.index(x[i])-1]
    else :
        S1=S1+x
    if p!=1 :
        S1=S1+'a'
        p=p-1
    
if S1.count('a')==len(S1) and c==1 :
    S1=S1[:len(S)-2]+'z'
print(S1)
    
        
    
