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 gl():
    return sys.stdin.readline().strip()

def gls():
    return gl().split()

def gi():
    return int(gl())

def gis():
    return map(int, gls())

def gfs():
    return map(float, gls())

def solve():
    inp = gl()
    l = len(inp)
    if inp.count('a')==l:
        print (l-1)*'a'+'z'
        return

    noa = False
    found = False
    for letter in inp:
        if found:
            sys.stdout.write("%c"%letter)
            continue
        if letter=='a' and noa:
            found = True
        if letter!='a':
            noa = True
            letter = chr(ord(letter)-1)
        sys.stdout.write("%c"%letter)
    print "" 
solve()
