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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * Created by first on 7/29/2018.
 */
public class LettersCyclicShift_A {
    public static void main (String [] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String input = br.readLine();
        int i = 0;
        boolean isSecondA = false;
        if(input.length() == 1){
            char c = 'z';
            if(input.charAt(0) != 'a') {
                c = (char) (input.charAt(0) - 1);
            }
            System.out.print(c);
            return;
        }
        while(i < input.length()) {
            if(input.charAt(i) != 'a'){
                isSecondA = true;
                char c = (char) (input.charAt(i) - 1);
                System.out.print(c);
                i++;
            }else if (isSecondA){
                break;
            }else {
                if(i != input.length() - 1) {
                    System.out.print(input.charAt(i));
                } else {
                    System.out.print('z');
                }
                i++;
            }

        }
        while (i < input.length()){
            System.out.print(input.charAt(i));
            i++;
        }
    }
}
