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();
foundl = foundr = False

for x in range(0, len(s)):
  if s[x] is not 'a':
    left = x
    foundl = True
    break

if not foundl:
  c = s[0:len(s)-1]
  c += 'z'
else:
  for x in range(left, len(s)):
    if s[x] is 'a':
      right = x
      foundr = True
      break

  c = s[:left]
  if foundr:
    for x in range(left, right):
      c += chr(ord(s[x])-1)
    c += s[right:]
  else:
    for x in range(left, len(s)):
      c += chr(ord(s[x])-1)
    
print(c)
