CF708A.Letters Cyclic Shift

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' 'y' 'x' 'b' 'a' '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?

给你一个非空字符串 $s$，它仅由小写英文字母组成。你需要恰好选择 $s$ 的一个非空子串，并将该子串中所有字母按如下规则进行移位：
'z' 'y' 'x' 'b' 'a' 'z'。
换言之，每个字符被替换为英文字母表中的前一个字符，而 'a' 被替换为 'z'。

通过恰好执行一次上述移位操作，你能从 $s$ 得到的字典序最小的字符串是什么？

The only line of the input contains the string s (1 ≤ |s| ≤ 100 000) consisting of lowercase English letters.

输入仅包含一行字符串 $s$（$1 \leq |s| \leq 100\,000$），由小写英文字母组成。

Print the lexicographically minimum string that can be obtained from s by shifting letters of exactly one non-empty substring.

打印通过对字符串 $s$ 中恰好一个非空子串的字母进行移位操作所能得到的字典序最小的字符串。

String s is lexicographically smaller than some other string t of the same length if there exists some 1 ≤ i ≤ |s|, such that _s_1 = _t_1, _s_2 = _t_2, ..., s__i - 1 = t__i - 1, and s__i < t__i.

字符串 $s$ 在字典序上小于另一个等长字符串 $t$，当且仅当存在某个 $1 ≤ i ≤ |s|$，使得 $s_1 = t_1,\, s_2 = t_2,\, \dots,\, s_{i-1} = t_{i-1}$，且 $s_i < t_i$。