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.
letters = ['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']

dataIn = str(input())
data = []
for i in dataIn:
    data.append(i)

count = 0
begin = 0

if len(data) == 1:
    if data[0] == 'a':
        data[0] = 'z'
    else:
        for j in range(len(letters)):
            if letters[j] == data[0]:
                data[0] = letters[j-1]
else:
    i = 0
    begin = False
    while i < len(data) - 1:
        if data[i] == 'a':
            i += 1
        else:
            break
    for k in range(i, len(data)):
        if data[k] == 'a' and k != len(data) - 1:
            break
        elif data[k] == 'a' and k == len(data) -1:
            if not begin: data[k] = 'z'
        else:
            begin = True
            for j in range(len(letters)):
                if letters[j] == data[k]:
                    data[k] = letters[j-1]

result = ''
for i in data:
    result += i

print(result)
