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.
from string import ascii_lowercase as la, maketrans
tr = 'zabcdefghijklmnopqrstuvwxy'
tt = maketrans(la, tr)
s = raw_input().strip()
l = len(s)
fc = 0
for i in range(l):
    if s[i] != "a":
        fc = i
        break
lc = l - 1    
for i in range(fc, l):
    if s[i] == "a":
        lc = i - 1
        break
sb = s[:fc]
se = s[lc+1:]
sa = s[fc:lc+1]
st = sa.translate(tt)
if st == "":
    se = se[:-1] + "z"
        
print sb+st+se