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.
class CodeforcesTask708ASolution:
    def __init__(self):
        self.result = ''
        self.string = ''

    def read_input(self):
        self.string = input()

    def process_task(self):
        s = -1
        e = -1
        for x in range(len(self.string)):
            if s >= 0:
                if self.string[x] == "a" and e < 0:
                    e = x
            elif self.string[x] != "a":
                if s < 0:
                    s = x
        if s == -1 and e == -1:
            s = len(self.string) - 1
            e = s + 1
        elif e == -1:
            e = len(self.string)
        out = list(self.string)
        #print(s, e)
        for x in range(len(out)):
            if s <= x < e:
                out[x] = chr(ord(out[x]) - 1)
        self.result = "".join(out).replace("`", "z")

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask708ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
