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 void solve() throws IOException {
      String s = next();
      int l = -1, r = -1;
      int n = s.length();
      for (int i = 0 ; i < n ; i ++) {
        char c = s.charAt(i);
        if (c != 'a') {
          l = i;
          break;
        }
      }      
      if (l == -1) {
        out.println(s.substring(0, n - 1) + 'z');
        return;
      }

      for (int i = l + 1 ; i < n ; i ++) {
        char c = s.charAt(i);
        if (c == 'a') {
          r = i;
          break;
        }
      }
      if (r == -1) {
        r = n;
      }
      StringBuilder sb = new StringBuilder();
      sb.append(s.substring(0, l));
      for (int i = l ; i < r ; i++) {
        sb.append((char)(s.charAt(i) - 1));
      }
      for (int i = r ; i < n ; i ++) {
        sb.append(s.charAt(i));
      }
      out.println(sb.toString());
    }

    

    
    
    BufferedReader bf;
    StringTokenizer st;
    PrintWriter out;
    
    public String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) 
            st = new StringTokenizer(bf.readLine());
        return st.nextToken();
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public Main() throws IOException {
        bf = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new OutputStreamWriter(System.out));		
        solve();
        bf.close();
        out.close();
    }
    
    public static void main(String args[]) throws IOException {
        new Main();
    }
}