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.*;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Main {

    static int a[];
    static int l[];
    static int ans[];
    static HashMap<Integer, Boolean> map = new HashMap<>();

    public static void main (String [] args) throws Exception {
        InputReader reader = new InputReader();
        PrintWriter out = new PrintWriter(System.out);
//        int n=reader.nextInt();
//        int m=reader.nextInt();
//
//

        String str = reader.next();
        int len=str.length();
        int [] arr = new int[len];
        for(int i = 0 ; i < len ; i++){
            arr[i]=(int) str.charAt(i);
        }

        int  f=0,modified=0;

        for(int i = 0 ; i < len ; i++){
            if(arr[i]==97&&f==0)continue;
            else if(arr[i]==97&& f==1){
                break;
            }
            else {
                f=1;
                arr[i]--;
                modified=1;
            }
        }
        if(modified==0){
           arr[len-1]=122;
        }
        for(int i = 0 ; i < len ; i++){
            System.out.print((char)arr[i]);
        }





        out.flush();
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader() {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}