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' $\text{[math]}$ 'y' $\text{[math]}$ 'x' $\text{[math]}$ 'b' $\text{[math]}$ 'a' $\text{[math]}$ '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.

Note

String s is lexicographically smaller than some other string t of the same length if there exists some 1 ≤ i ≤ |s|, such that s₁ = t₁, s₂ = t₂, ..., s_i - 1 = t_i - 1, and s_i < t_i.

Letters Cyclic Shift

Examples