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.
# -*- coding: utf-8 -*-
"""
Created on Wed Aug 24 13:19:53 2016

@author: Felicia
"""

s = input()
n = len(s)
hea = -1
tai = -1
new = list(s)

for i in range(n):
    if new[i]!='a':
        hea = i
        for j in range(i+1,n):
            if new[j]=='a':
                tai = j-1
                break
        else:
            tai = n-1
        for k in range(hea,tai+1):
            temp = ord(new[k])-1
            new[k] = chr(temp)
        break

if hea ==-1:
    new[n-1] = 'z'
    
news = ''.join(new)
print(news)
