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.
def shift(de):
    abc = 'a b c d e f g h i j k l m n o p q r s t u v w x y z'
    abc = map(str, abc.split())
    for i, x in enumerate(abc):
        if de == x:
            i -= 1
            return abc[i]

def size():
    x = list(raw_input())
    b = 0
    
    if all( c == 'a' for c in x ):
        x[-1] = shift(x[-1])
        print ''.join(x)
        return

    while len(x) > b and x[b] == "a":
        b += 1
        
    while len(x) > b and x[b] != 'a':
        x[b] = shift(x[b])
        b += 1
    print ''.join(x)
    
size()    
