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.
import sys
import string

d = {}
for (i, x) in enumerate(string.ascii_lowercase):
    if x == 'a':
        d[x] = 'z'
    else:
        d[x] = string.ascii_lowercase[i-1]


status = 0
t = []

for x in sys.stdin.readline().strip():
    if status == 2:
        t.append(x)
    
    elif status == 1:
        if x == 'a':
            t.append(x)
            status = 2
        
        else:
            t.append(d[x])
    
    else:
        if x == 'a':
            t.append(x)
        
        else:
            t.append(d[x])
            status = 1


if status == 0:
    # we need to change!
    assert t[-1] == 'a'
    t = t[:-1] + ['z']


print "".join(t)

