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 = raw_input()
def shift(x):
    if x == "a":
        return "z"
    else:
        return chr(ord(x) - 1)
#print shift("a"), shift("z"), shift("x")

l1 = len(s)
for i in range(len(s)):
    if s[i] != "a":
        l1 = i
        break

l2 = len(s)
for i in range(l1, len(s)):
    if s[i] == "a":
        l2 = i
        break
#print l1, l2
if l1 == len(s):
    print s[:-1] + "z"
else:
    mid = "".join([shift(s[i]) for i in range(l1, l2)])
    end = s[l2:]
    print s[:l1] + mid + end