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.

# coding: utf-8

# In[56]:

s = raw_input()
flag = True
i = 0;
t = ''
while i < len(s) and s[i] == 'a':
    i += 1
if i == len(s):
    t = s[:-1] + 'z'
else:
    j = s.find('a', i + 1)
    if j == -1:
        j = len(s)
    t = ''
    t = s[:i]
    for k in range(i, j):
        t = t + chr(ord(s[k]) - 1)
    t = t + s[j:]
print t


# In[ ]:



