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.
q = 'abcdefghijklmnopqrstuvwxyz'
w = dict()
for i in range(26):
    w[q[i]] = q[i-1]
s = input()
l = 0
if(s == 'a' * len(s)):
    print('a' * (len(s) - 1) + 'z')
else:
    while s[l] == 'a':
        l+=1
    r = l + 1
    while(r < len(s) and s[r] != 'a'):
        r+=1
    print(s[:l], end = '')
    for i in range(l,r):
        print(w[s[i]], end = '')
    print(s[r:], end = '')
    print()


