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=str(input())
cnt=0
l2=list(s)
l=int(len(l2))
for i in s:
    if (i=='a'):
        cnt+=1
if cnt==l:
    l2[l-1]='z'
else:
    if (cnt==0):
        for i in range(l):
            l2[i]=chr(ord(l2[i])-1)
    else:
        for i in range(l):
            if l2[i]!='a':
                l2[i]=chr(ord(l2[i])-1)
            else:
                loc=i
                break
        if loc==0:
            for i in range(loc+1,l):
                if l2[i]!='a':
                    loc2=i
                    break
            for i in range(loc2,l):
                if l2[i]!='a':
                    l2[i]=chr(ord(l2[i])-1)
                else:
                    break
for j in l2:
    print(j,end='')