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.
s=input()
string=s

xd = ""
for c in range(0,len(s)):
  if s[c] is not 'a':
    i=c
    break
  else:
    i=len(s)
    if c!=len(s)-1:
      #print('a')
      xd += 'a'
    else:
      #print('z')
      xd += 'z'
    
if i!=len(s):
  for c in range(i,len(s)):
    if s[c] is not 'a':
      #print(chr(ord(s[c])-1))
      xd += chr(ord(s[c])-1)
      z=len(s)
    else:
      z=c
      break
    
  #print(s[z:])
  xd += s[z:]

print(xd)
