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.*;
public class Main{
    public static void main(String args[]){
        Scanner in=new Scanner(System.in);
        char[] s=in.nextLine().toCharArray();
        int i=0,n=s.length,flag=0;
        while(i<n&&s[i]!='a'){ --s[i];++i;flag=1;}
        if(flag==0){
            i=0;
            while(i<n&&s[i]=='a') ++i;
            if(i==n){
                s[n-1]='z';
            }
            else{
                while(i<n&&s[i]!='a'){ --s[i];flag=1;++i;}
            }
        }
    System.out.print(s);
    }
}