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.
def inp():
    return int(raw_input())
def linp():
    return map(int, raw_input().split())
s=list(raw_input())
if len(set(s))==1 and s[0]=='a':
    s[len(s)-1] = 'z'
    print ''.join(s)
    exit()
alph = "abcdefghijklmnopqrstuvwxyz"
dic={}
for i in xrange(len(alph)):
    dic[alph[i]] = i
flag = 0
ans=""
for i in xrange(len(s)):
    if flag==0:
        if s[i]=='a':
            ans+='a'
        else:
            flag = 1
            ans+=alph[dic[s[i]]-1]
    elif flag==1:
        if s[i]=='a':
            flag = 2
            ans+='a'
        else:
            ans+=alph[dic[s[i]]-1]
    else:
        ans+=s[i]
print ans