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 foo(s,start,end):
  if s[start]=='a':
    return s[:start]+'z'
  x=list(s)
  for i in range(start,end+1):
    x[i]=chr(ord(x[i])-1)
  return "".join(x)

s=input().strip()
start=0
while start<len(s) and s[start]=='a':
  start+=1
if start==len(s):
  start=len(s)-1
  end=len(s)-1
else:
  end=start+1
  while end<len(s) and s[end]!='a':
    end+=1
  end-=1
print(foo(s,start,end))
