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()
n = len(s)
x = s.count("a")
f =- 1
t = 3
if x==0:
    s = list(s)
    for i in range(n):
        m = ord(s[i])
        s[i] = chr(m-1)
    for i in s:
        print(i,end="")
elif(x==n):
    s = list(s)
    s[n-1] = "z"
    for i in s:
        print(i,end="")

elif s[0]=="a" :
    s = list(s)
    for i in range(1,n):
        if s[i]!= "a" :
            m = ord(s[i])
            s[i] = chr(m-1)
            f = 0
        elif f==0 :
            break
        elif f!=0 :
            continue
    for i in s:
        print(i,end="")
else :
    s = list(s)
    for i in range(0,n):
        if s[i]!= "a" :
            m = ord(s[i])
            s[i] = chr(m-1)
            f = 0
        elif f==0 :
            break
        elif f!=0 :
            continue
    for i in s:
        print(i,end="")
