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()
ib = 0
while ib < len(s):
    if s[ib] != 'a':
        break
    ib += 1
ie = ib + 1
while ie < len(s):
    if s[ie] == 'a':
        break
    ie += 1
if ib == ie - 1 == len(s):
    ib -= 1
    ie -= 1
new = ''.join(map(chr, [122 if x == 97 else x - 1 for x in map(ord, s[ib:ie])]))
print s[:ib] + new + s[ie:]
