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=raw_input()
flag=True
if(len(s)==1 and s[0]=='a'):
    print 'z'
    exit(0)
for a in range(len(s)):
    if(s[a]!='a'):
        flag=False
        break
if(flag):
    l = list(s)
    l[-1] = 'z'
    s = ''.join(l)
    print ('%s'%s)
    exit(0)
flag=True
x=0
ans=''
if s[0]=='a':
    for a in range(len(s)):
        if s[a]!='a' and x!=2:
            ans+=chr(ord(s[a])-1)
            x=1
        elif s[a]=='a' and x==1:
            x=2
            ans+=s[a]
        else:
            ans+=s[a]
else:
    for a in range(len(s)):
        if s[a]!='a' and flag:
            ans+=chr(ord(s[a])-1)
        else:
            ans+=s[a]
            flag=False
print ('%s'%ans)