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()

# start at the first non-a character
# end before the next a character
# or, if all 'a's, then just do the last one

def shift(c):
    return chr(ord(c) - 1) if c != 'a' else 'z'

if len(set(s)) == 1 and 'a' in s:
    print s[:-1] + 'z'
else:
    news = ""
    i = 0
    while s[i] == 'a':
        news += s[i]
        i += 1
    news += shift(s[i])
    i += 1
    # i is first non-a character
    while i < len(s) and s[i] != 'a':
        news += shift(s[i])
        i += 1
    while i < len(s):
        news += s[i]
        i += 1
    print news
