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.
#from dust i have come dust i will be

s=input()

cnt=0
for i in range(len(s)):
    if s[i]=='a':
        cnt+=1
    else:
        break

if cnt==len(s):
    for i in range(len(s)-1):
        print('a',end='')
    print('z')
    exit(0)

if s[0]=='a':
    k=1000000
    j=-1

    for i in range(len(s)):
        if s[i]!='a':
            j=i
            break
        print(s[i],end='')

    for i in range(j,len(s)):
        if s[i]=='a':
            k=i
            break

        print(chr(ord(s[i])-1),end='')

    for i in range(k,len(s)):
        print(s[i],end='')

else:
    k = 1000000

    for i in range(len(s)):
        if s[i] == 'a':
            k = i
            break

        print(chr(ord(s[i])-1), end='')

    for i in range(k, len(s)):
        print(s[i], end='')

