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.
from sys import stdin, exit

s = stdin.readline().strip()

if len(set(s)) == 1 and s[0] == 'a':
    print(s[:-1], 'z', sep='')
    exit(0)

changing = False

to = len(s)

for i, c in enumerate(s):
    if c != 'a' and not changing:
        changing = True
        from_ = i
    elif c == 'a' and changing:
        to = i
        break

print(s[:from_], ''.join(chr(ord(c) - 1) for c in s[from_:to]), s[to:], sep='')
