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.
//package variable_data_operator;

import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by tsotne on 2/21/17.
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a=0;
        String s=in.nextLine();
        for(int i=0;i<s.length()-1;i++)
        {
            if(a==0)
            {
                if(s.charAt(i)=='a')
                    System.out.print('a');
                else
                {
                    a=1;
                    char u=(char)(s.charAt(i)-1);
                    System.out.print(u);
                }
            }
            else
            {
                if(s.charAt(i)=='a')
                {
                    for(int j=i;j<s.length();j++)
                        System.out.print(s.charAt(j));
                    return;
                }
                else
                {
                    char u=(char)(s.charAt(i)-1);
                    System.out.print(u);
                }
            }
        }
        if(s.charAt(s.length()-1)=='a')
        {
            if(a>0)
                System.out.print('a');
            else
                System.out.print('z');
        }
        else
        {
            char u=(char)(s.charAt(s.length()-1)-1);
            System.out.print(u);
        }
    }
}
