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.
#!/usr/bin/env python3.5
import sys
import itertools

def read_data():
    s = next(sys.stdin).strip()
    return s


def solve(s):
    characters = []
    state = 0
    for c in s:
        if state == 0:
            if c == 'a':
                characters.append(c)
            else:
                state = 1
        if state == 1:
            if c == 'a':
                state = 2
            else:
                characters.append(chr(ord(c) - 1))
        if state == 2:
            characters.append(c)
    if state == 0:
        characters[-1] = 'z'
    return ''.join(characters)


if __name__ == "__main__":
    s = read_data()
    ans = solve(s)
    print(ans)
