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()
i = 0
j = 1
curr = 0
state = 0
for k in s:
    if k == 'a':
        if state == 1:
            state = 2
        if state == 0:
            i = curr
            j = i + 1
        curr += 1
    elif state == 0:
        i = curr
        j = i + 1
        state = 1
        curr += 1
    elif state == 1:
        j += 1
        curr += 1
    elif state == 2:
        break
rev = ''
alphabet = 'abcdefghijklmnopqrstuvwxyza'
d = dict()
for k in range(1, 27):
    d[alphabet[k]] = alphabet[k - 1]
for k in range(i, j):
    rev += d[s[k]]
print(s[:i] + rev + s[j:])