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.
#in the nmae of god
#Mr_Rubik
refer_dict = {'a': 'z','b': 'a','c': 'b','d': 'c','e': 'd','f': 'e','g': 'f','h': 'g','i': 'h','j': 'i','k': 'j','l': 'k','m': 'l','n': 'm','o': 'n','p': 'o','q': 'p','r': 'q','s': 'r','t': 's','u': 't','v': 'u','w': 'v','x': 'w','y': 'x','z': 'y',}
s=str(input())
line=s.split('a')
size=len(line)
flag=True
for it in range(size):
    if line[it] != '':
        temp = str()
        for i in line[it]:
            temp += refer_dict[i]
        line[it] = temp
        flag = False
        break
if flag:
    print(s[:-1] + 'z')
else:
    print('a'.join(line))