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.IOException;
import java.io.PrintStream;
import java.util.Scanner;


public class C {

	private static Scanner in = new Scanner(System.in);
	private static PrintStream out = System.out;
	//private static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	//private static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	
	public static void main(String[] args) throws IOException {
		char[] s = in.next().toCharArray();
		int n = s.length;
		int x = 0;
		while (x < n && s[x] == 'a')
			++x;
		if (x == n) {
			s[n - 1] = 'z';
		} else {
			int y = x;
			while (y < n && s[y] != 'a')
				++y;
			for (int i = x; i < y; ++i)
				s[i] = (char) (s[i] - 1);
		}
		out.println(new String(s));
	}

}
