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()
tam = len(s)
v = []
# print(s)
i = 0
flag = False
while i <= tam-1:
    if s[i] != "a" and flag == False:
        flag = True
        while i < tam and s[i] != "a":
            v.append(ord(s[i]) - 98)
            i+=1
    if i > tam-1:
        break
    v.append(ord(s[i])-97)
    i+=1

if flag == False:
    v[tam-1] = 25
for i in range(tam):
    print(chr(v[i]+97),end='')
print()
