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.
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.util.Scanner;

/**
 *
 * @author HP
 */
public class LettersCyclicShift {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        int i, acount = 0;
        char z;
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        StringBuilder x = new StringBuilder(s);
        for (i = 0; i < x.length(); i++) {
            if (x.charAt(i) == 'a') {
                acount++;
            }
        }
        if (acount==x.length()) {
            for(i=0;i<x.length()-1;i++){
                System.out.print(x.charAt(i));
                
            }
            System.out.print("z");
        } else {
            for (i = 0; i < x.length(); i++) {
                if (x.charAt(i) == 'a') {
                    z = (char) (x.charAt(i));
                    System.out.print(z);
                } else if (x.charAt(i) != 'a') {
                    z = (char) (x.charAt(i) - 1);
                    System.out.print(z);
                    if (i != x.length() - 1) {
                        if (x.charAt(i + 1) == 'a') {
                            i++;
                            break;
                        }
                    }
                }
            }
            for (i = i; i < x.length(); i++) {
                System.out.print(x.charAt(i));
            }
        }
    }
}
