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.*;
import java.math.*;
public class LetterShift{
    public static void main(String[] args) {
        MyScanner sc=new MyScanner();
        char arr[]=(sc.next()).toCharArray();
        int L=arr.length;
        int i=0;
        StringBuilder str=new StringBuilder();
        boolean b=false;
        while(i<L){
            if(arr[i]=='a'){i++;str.append('a');continue;}
            if(b){str.append(arr[i]);i++;continue;}
            while(i<L && arr[i]!='a'){
                char prev=(char)(arr[i]-1);
                str.append(prev);
                i++;
                b=true;
            } // end of inner while
        } // end of outer while
        if(b) System.out.println(str);
        else{
            String s=str.substring(0,str.length()-1)+"z";
            System.out.println(s);
        }
    }


    private static class MyScanner {
      BufferedReader br;
      StringTokenizer st;

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

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

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

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

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

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