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 collections import defaultdict
import sys, os, math

if __name__ == "__main__":
    #n, m = list(map(int, input().split()))
    s = input()
    ss = "abcdefghijklmnopqrstuvwxyz"
    sss = ''
    if s[0] != 'a':
        for i in range(len(s)):
            if s[i] == 'a':
                sss += s[i:]
                break
            sss += ss[ord(s[i]) - ord('a') - 1]
    else:
        pos = 0
        while pos < len(s) and s[pos] == 'a':
            pos += 1
        if pos == len(s):
            for i in range(len(s) - 1):
                sss += 'a'
            print(sss + 'z')
            sys.exit(0)
        sss += s[:pos]
        for i in range(pos, len(s)):
            if s[i] == 'a':
                sss += s[i:]
                break
            sss += ss[ord(s[i]) - ord('a') - 1]
    print(sss)
        