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.
if __name__ == '__main__':
    s = list(input())
    if len(set(s)) == 1 and s[0] == 'a':
        s[-1] = 'z'
        print(''.join(map(str, s)))
    else:
        k = 0
        add = []

        for x in s:
            if x == 'a':
                add.append('a')
            else: break
        s = s[len(add):]
        for x in s:
            if x != 'a': k +=1
            else: break
        t=[]
        for x in s[:k]: t.append(chr(ord(x) - 1))
        s[:k]=t
        s = add+s
        print(''.join(map(str,s)))