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()
n = len(s)
begin = 0
for i in xrange(n):
    if s[i] == 'a':
        begin += 1
    else:
        break
if begin == n:
    ans = s[0:n-1] + 'z'
else:
    end = begin + 1
    for i in xrange(begin+1, n):
        if s[i] == 'a':
            break
        else:
            end += 1
    mid = ''.join([chr(ord(c)-1) for c in s[begin:end]])
    ans = s[:begin] + mid + s[end:n]
print ans