Description:
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' $$\rightarrow$$ 'y' $$\rightarrow$$ 'x' $$\overrightarrow { a }, \ldots, \overrightarrow { a }$$ 'b' $$\rightarrow$$ 'a' $$\rightarrow$$ '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 Format:
The only line of the input contains the string s (1 ≤ |s| ≤ 100 000) consisting of lowercase English letters.
Output Format:
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 s1 = t1, s2 = t2, ..., si - 1 = ti - 1, and si < ti.