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;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        StringBuilder ns = new StringBuilder();
        boolean check = true;
        boolean check2 = true;
        boolean check3 = true;
        for (int i = 0; i < s.length(); i++) {
            if (check3 && check && i == s.length() - 1 && s.charAt(i) == 'a') {
                ns.append("z");
            } else if (s.charAt(i) == 'a' && i == 0) {
                ns.append((char) (s.charAt(i))).append("");
                check2 = false;
            } else if (!check2 && check && i == s.length() - 1 && s.charAt(i) == 'a') {
                ns.append("z");
            } else if (s.charAt(i) == 'a') {
                ns.append((char) (s.charAt(i))).append("");
                if (check2) {
                    check = false;
                }
            } else if (check) {
                ns.append((char) (s.charAt(i) - 1)).append("");
                check2 = true;
                check3 = false;
            } else {
                ns.append((char) (s.charAt(i))).append("");
            }
        }
        System.out.println(ns);
    }
}
