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.
//package aimtechround3_c;

import java.util.*;

public class AIMTechRound3_C {

    public static String s;
    public static int n;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        s = sc.nextLine();
        n = s.length();
        char[] a = s.toCharArray();
        int Pos = -1;
        for(int i = 0; i < n; i++){
            if(a[i] != 'a'){
                Pos = i;
                break;
            } 
        }
        if(Pos == -1) a[n - 1] = 'z';
        else {
            for(int i = Pos; i < n; i++){
                if(a[i] == 'a') break;
                int d = (int)a[i];
                a[i] = (char)(d - 1);
            }
        }
        for(int i = 0; i < n; i++) System.out.print(a[i]);
    }
    
}
