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.
#!/usr/bin/python

import sys

s = raw_input().strip()

#
# This can't possibly be right, it would be way too easy.
# where's the catch?
#
answer = []
shifting = False
didShift = False
pos = 0
for c in s:
    pos += 1
    if shifting and c != 'a':
        answer.append(chr(ord(c)-1) if c != 'a' else 'z')
        didShift = True
    elif not shifting and c != 'a':
        shifting = True
        answer.append(chr(ord(c)-1) if c != 'a' else 'z')
        didShift = True
    elif shifting and c == 'a':
        answer += s[pos-1:]
        break
    elif not shifting and c == 'a':
        answer.append(c)
    else:
        raise Error()

    # print "".join(answer)

if didShift:
    print "".join(answer)
else:   # all 'a' (?)
    print s[:-1] + 'z'
