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.
a=input()
b=''
fla=0
f2 = 0
ii=0
for i in range(0,len(a)):
    if ii==0 and i==len(a)-1:
        if a[i]=='a':
            b+='z'
        else:
            b+=chr(ord(a[i])-1)
    elif a[i]=='a':
        b+='a'
        if(f2):
            fla = 1
    elif not fla:
        b+=chr(ord(a[i])-1)
        f2=1
        ii=1
    else:
        b+=a[i]
print(b)
