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.*;
import java.io.*;

public class solution {
    public static int gcd(int a, int b) {
        if (b == 0) {
            return a;
        } else {
            return gcd(b, a % b);
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
            StringBuilder ans = new StringBuilder();
            int j = 0;
            for (int i = 0; i < s.length(); i++) {
                if (s.charAt(i) != 'a') {
                    break;
                } else {
                    ans.append('a');
                    j++;
                }
            }
            if (j == s.length()) {
                ans.setCharAt(s.length() - 1, 'z');
            } else {
                boolean flag = true;
                for (int i = j; i < s.length(); i++) {
                    if (s.charAt(i) == 'a') {
                        flag = false;
                    }
                    if (flag) {
                        int b = s.charAt(i) - 'a';
                        b--;
                        char c = (char) (b + 'a');
                        ans.append(c);
                    } else {
                        ans.append(s.charAt(i));
                    }
                }
            }
            System.out.println(ans.toString());
    }

    static class sort implements Comparator<ArrayList<Integer>> {

        @Override
        public int compare(ArrayList<Integer> o1, ArrayList<Integer> o2) {
            int c = o1.get(0).compareTo(o2.get(0));
            return c;
        }

    }
}