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.
# -*- coding:utf-8 -*-


def some_func():
    """
    """
    n_str = raw_input()
    cache = []
    flag = 0
    if n_str.count('a')==len(n_str):
        print 'a'*(len(n_str)-1) + 'z'
        return ''
    for v in n_str:
        if v>'a' and flag==0:
            flag=1
            cache.append(chr(ord(v)-1))
        elif v=='a' and flag==0:
            cache.append(v)
        elif v>'a' and flag==1:
            cache.append(chr(ord(v)-1))
        elif v=='a' and flag==1:
            flag=2
            cache.append(v)
        elif flag==2:
            cache.append(v)

    print ''.join(cache)









if __name__ == '__main__':
    some_func()


