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.StringTokenizer;

public class Codeforces_AIMTech_round_3_div_1_LettersCyclicShift {

    public static void main(String[] args) {
        FScanner input = new FScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        String original = input.nextLine();
        StringBuilder line = new StringBuilder(original);
        int index = 0;
        for (int i = 0; i < line.length(); i++) {
            if (line.charAt(i) != 'a') {
                break;
            } else {
                index++;
            }
        }
        for (int i = index; i < line.length(); i++) {
            if (line.charAt(i) != 'a') {
                line.setCharAt(i, (char) ((int) line.charAt(i) - 1));
            } else {
                break;
            }
        }
        if (line.toString().equals(original)) {
            int i = line.length() - 1;
            if (line.charAt(i) != 'a') {
                line.setCharAt(i, (char) ((int) line.charAt(i) - 1));
            } else {
                line.setCharAt(i, 'z');
            }
            out.println(line);
        } else {
            out.println(line);
        }
        out.close();
    }

    public static PrintWriter out;

    public static class FScanner {
        BufferedReader br;
        StringTokenizer st;

        public FScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}