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 A708 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        String answer;
        int idx = 0;
        while (idx < s.length() && s.charAt(idx) == 'a') idx++;
        if (idx == s.length()) {
            // aaaaaa
            answer = s.substring(1) + 'z';
        } else {
            int idx2 = idx+1;
            while (idx2 < s.length() && s.charAt(idx2) != 'a') idx2++;
            StringBuilder sb = new StringBuilder(s);
            for (int i=idx; i<idx2; i++) {
                char c = sb.charAt(i);
                c = (char) (c-1);
                sb.setCharAt(i, c);
            }
            answer = sb.toString();
        }
        System.out.println(answer);
    }

}
