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.
import sys

def cycle(letter):
    if letter=='a':
        return 'z'
    else:
        return chr(ord(letter)-1)

word = list(sys.stdin.readline().strip())

notAIndex = -1
for i in xrange(len(word)):
    if word[i]!='a':
        notAIndex = i
        break

if notAIndex == -1:
    word[len(word)-1] = 'z'
    print ''.join(word)
    sys.exit()

endIndex = len(word)
for i in xrange(notAIndex, len(word)):
    if word[i]=='a':
        endIndex = i
        break

for i in xrange(notAIndex, endIndex):
    word[i] = cycle(word[i])

print ''.join(word)