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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class AIMTechC {

	public static void main(String args[]) throws IOException {

		BufferedReader obj = new BufferedReader(new InputStreamReader(System.in));
		String inp = obj.readLine();
		int end = -1;
		int st = -1;
		StringBuilder sb = new StringBuilder("");
		for (int i = 0; i < inp.length(); i++) {
			char c = inp.charAt(i);
			if (c != 'a') {
				st = i;
				break;
			}
		}

		for (int i = st + 1; i < inp.length(); i++) {
			char c = inp.charAt(i);
			if (c == 'a')
				break;
			end = i;
		}

		if (st == -1) {
			sb.append(inp.substring(0, inp.length() - 1)).append("z");
		} else {
			if (end == -1)
				end = st;
			sb.append(inp.substring(0, st));
			for (int i = st; i <= end; i++) {
				int c = inp.charAt(i);
				char c1 = (char) (c - 1);
				sb.append(c1);
			}

			sb.append(inp.substring(end + 1, inp.length()));
		}

		System.out.println(sb);
	}

}
