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 aj {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int l = s.length();
        boolean flag = false;
        boolean complete = false;
        int count = 0;
        int position = 0;
        while(position<s.length()&&s.charAt(position)=='a'){
            count++;
            position++;
        }
        if (count == s.length()) {
            for (int i = 0; i < l-1; i++) {
                System.out.print('a');
            }
            System.out.println('z');
        }
        else if (s.length()==1) {
            if (s.charAt(0)=='a') {
                System.out.println('z');
            }
            else
                System.out.println((char)(s.charAt(0)-1));
        }
        else{
        for (int i = 0; i < l; i++) {
            if (complete) {
                System.out.print(s.charAt(i));
                continue;
            }
            if (flag) {
                if (s.charAt(i)!='a') {
                    i--;
                    flag = false;
                    continue;
                }
                else{
                    System.out.print('a');
                    continue;
                }
            }
            if (i==0&&s.charAt(i)=='a') {
                System.out.print('a');
                flag = true;
                continue;
            }
            if (s.charAt(i)=='a') {
                complete = true;
                System.out.print('a');
                continue;
            }
            char word = s.charAt(i);
            if (word=='a') {
                System.out.println('a');
                complete = true;
            }
            System.out.print((char)(word-1));
        }
        System.out.println("");
    }}
}   
