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
from decimal import *

def main():
    s = sys.stdin.readline().rstrip()

    x= []
    step = 0
    for i in range(len(s)):
        c = s[i]
        if step == 0:
            if c == 'a':
                x.append(c)
            else:
                step = 1
                x.append(chr(ord(c)-1))
        elif step ==1:
            if c == 'a':
                step = 2
                x.append(c)
            else:
                x.append(chr(ord(c)-1))
        else:
            x.append(c)

    if step ==0:
        x[-1] = 'z'

    print(''.join(x))





main()
