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
import math
def input():    return sys.stdin.readline().strip()
def iinput():   return int(input())
def minput():   return map(int, input().split()) 
def listinput(): return list(map(int, input().split()))
""" a=input()
b=input()
c=input()
a+=b
if len(a)!=len(c):
    print("NO")
else:
    orig,check={},{}
    for i in range(len(a)):
        orig[a[i]]=orig.get(a[i],0)+1
        check[c[i]]=check.get(c[i],0)+1
    k=list(set(map(str,a)))
    answer="YES"
    for i in k:
        if orig.get(i,0)!=check.get(i,0):
            answer="NO"
            break
    print(answer) """
""" 
l=listinput()
l.insert(0,999)
for i in range(1,len(l)):
    d={}
    while True:
        d[i]=d.get(i,0)+1
        i=l[i]
        if d.get(i,0)==2:
            print(i,end=' ')
            break """
"""             
n=iinput()
answer=0
for i in range(n//1234567+1):
    for j in range((n-i*1234567)//123456+1):
        if (n-i*1234567-j*123456)%1234==0:
            answer=1
            break
    if answer:
        break
if answer:
    print("YES")
else:
    print("NO") """
s=list(map(str,input()))
i=0
while i < len(s) and s[i]=='a':
    i+=1
if i == len(s):
    print(''.join(s)[:-1]+'z')
else:
    while i< len(s) and s[i]!='a':
        s[i]=chr(ord(s[i])-1)
        i+=1
    print(''.join(s))