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 AimTech3C {
	public static void main(String[] args) throws Exception {
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		Scanner s = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		char[] a = f.readLine().toCharArray();
		int n = a.length;
		boolean hasA = false, hasOther = false;
		StringBuilder ans = new StringBuilder();
		int longest = 0; int bestI = 0, bestJ = 0;
		int lastA = -1;
		for(int i = 0; i < n; i++) {
			if(a[i] == 'a') hasA = true;
			else hasOther = true;
			if(a[i] != 'a') {
				bestI = i;
				while(i  < n && a[i] != 'a') {
					i++;
				}
				bestJ = i-1;
				break;
			}
		}
		if(!hasOther) {
			bestI = n-1;
			bestJ = n-1;
		}
		for(int i = 0; i < n; i++) {
			if(i >= bestI && i <= bestJ) {
				char append = (char)(a[i]-1);
				if(a[i] == 'a') append = 'z';
				ans.append(append);
			} else ans.append(a[i]);
		}
		System.out.println(ans.toString());
	}
}