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 random import random

S = raw_input()
start = -1
end = 0
i = 0
while i < len(S) and S[i] == 'a':
    start = i
    i += 1
while i < len(S) and S[i] != 'a':
    end = i
    i += 1
# print start, end, S[start+1:end+1]
if start == len(S) - 1:
    print S[:-1] + "z"
else:
    print S[:start+1] + "".join(map(lambda x: chr((ord(x)-1-97)%26+97), S[start+1:end+1])) + S[end+1:]
