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.
# Description of the problem can be found at http://codeforces.com/problemset/problem/708/A

s = input()

c_i = None
c_i_e = len(s)
for i in range(len(s)):
    if s[i] != "a":
        if c_i == None:
            c_i = i
    elif c_i != None:
        c_i_e = i
        break

if c_i == None:
    print(s[0:len(s) - 1], end="")
    print("z")
else:   
    print(s[0:c_i], end="")
    for i in range(c_i, c_i_e):
        if s[i] == 'a':
            print('z', end = "")
        else:
            print(chr(ord(s[i]) - 1), end="")
    print(s[c_i_e:])