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/python2
# -*- coding: utf-8 -*-

import sys
import os

rl = sys.stdin.readline
srl = lambda: rl().split()

def main():
    s = rl().rstrip()
    q = ""
    if any(x != 'a' for x in s):
        c = 0
        for x in s:
            if c == 1 and x == 'a':
                c = 2
            if c > 1:
                q += x
                continue
            if x != 'a':
                c = 1
                q += chr(ord(x) - 1)
            else:
                q += x
    else:
        q = s[:-1] + 'z'
    print q


if __name__ == '__main__':
    main()
