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)throws java.lang.Exception
{
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
PrintWriter out=new PrintWriter(System.out);

int len,replaced,i,pos;
boolean discontinued;


String alphabets="abcdefghijklmnopqrstuvwxyz";
String str;

str=in.readLine().trim();
len=str.length();


StringBuffer strBuffer=new StringBuffer("");
replaced=0;
discontinued=false;

for(i=0;i<len-1;i++)
{
    if(str.charAt(i)!='a')
    {
        if(!discontinued)
        {
        pos=str.charAt(i)-97-1;
        strBuffer.append(alphabets.charAt(pos));
        replaced++;
        }
        else
        {
        pos=str.charAt(i)-97;
        strBuffer.append(alphabets.charAt(pos));
        }
    }
    else
    {
        if(replaced>0)
            discontinued=true;

        strBuffer.append(alphabets.charAt(0));

    }
}


if(replaced==0)
    {
    pos=str.charAt(i)-97-1;
    if(pos==-1)
        pos=25;
    strBuffer.append(alphabets.charAt(pos));
    }
else
    {
    pos=str.charAt(i)-97;
    if(!discontinued)
        if(pos>0)
            pos--;
    strBuffer.append(alphabets.charAt(pos));
    }


out.println(strBuffer.toString());




out.close();
out.flush();
}
}