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.Scanner;

public class Main {
  static String s;

  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    s = sc.next();
    int n = s.length();
    int l = -1;
    for(int i = 0; i < n; i++){
      if(s.charAt(i) != 'a'){
        l = i - 1;  break;
      }
    }
    int r = l + 1;
    for(int i = l + 1; i < n; i++){
      if(s.charAt(i) == 'a'){
        break;
      }
      r = i + 1;
    }

    StringBuilder sb = new StringBuilder();
    sb.append(s.substring(0, l + 1));
    for(int i = l + 1; i < r; i++){
      char tmp = (char)((26 + (s.charAt(i) - 'a') - 1) % 26 + 'a');
      sb.append(tmp);
    }
    if(r < n){
      sb.append(s.substring(r, n));
    }

    if(s.equals(sb.toString())){
      char[] tmp = new char[1];
      tmp[0] = (char)((26 + (sb.charAt(sb.length() - 1) - 'a') - 1) % 26 + 'a');
      sb = sb.replace(sb.length() - 1, sb.length(), new String(tmp));
    }

    System.out.println(sb.toString());
  }
}