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 java.util.Scanner;

/**
 * Aug 24, 2016 | 5:33:04 PM
 * <pre>
 * <u>Description</u>
 *
 * </pre>
 * <p>
 * @author Essiennta Emmanuel (colourfulemmanuel@gmail.com)
 */
public class ProblemC {

    void solve(char[] a) {
        int i = -1;
        while (++i != a.length && a[i] == 'a');
        if (i == a.length)
            a[a.length - 1] = 'z';
        else {
            --i;
            while (++i != a.length && a[i] != 'a')
                a[i]--;
        }
    }

    public static void main(String[] args) {
        try (Scanner sc = new Scanner(System.in)) {
            char[] a = sc.next().toCharArray();
            new ProblemC().solve(a);
            System.out.println(new String(a));
        }
    }
}
