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.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author arabtech
 */
public class Bletter {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        String s;
        boolean a = false, onceA = false, less = false;
        Scanner scan = new Scanner(System.in);
        s = scan.next();
        char[] s1 = s.toCharArray();
        for (int i = 0; i < s.length(); i++) {
            if (s1[i] == 'a' && i != s.length() - 1) {
                if (a) {
                    less = true;
                } else {
                    onceA = true;
                }
                System.out.print('a');
            } else if (s1[i] == 'a' && i == s.length() - 1 && !a) {
                System.out.print('z');
            } else if (s1[i] == 'a' && i == s.length() - 1 && a) {
                System.out.print('a');
            } else if (s1[i] != 'a' && !less) {
                a = true;
                System.out.print((char) (s1[i] - 1));
            } else if (less) {
                System.out.print(s1[i]);
            }
        }
    }
}
