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;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.BitSet;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Main1 {
	static PrintWriter out = new PrintWriter(System.out);
	static FastReader input = new FastReader();

	

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

		String s = input.nextLine();
		
		char [] let = s.toCharArray();
		
		int startIndx = -1 ; 
		int endIndx = -1;
		
		for (int i = 0 ; i < s.length() ; i++) {
		
			if (startIndx==-1&&let[i]!='a') startIndx = i ;
		
			else if (startIndx !=-1&&let[i]=='a') { endIndx = i; break;}
		}
		
		if (startIndx == -1 ) {startIndx = s.length()-1 ;  }
		
		if (endIndx==-1) endIndx = s.length();

		for (int i =startIndx ; i< endIndx ; i++) {
			if (let[i]=='a') let[i] = 'z';
			else 
			let[i] = (char)(let[i]-1);
		}
		
		for (int i = 0 ; i < s.length() ; i++) {
			out.print(let[i]);
		}
		
		
		
		
		out.flush();
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreElements()) {
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}

		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

		String nextLine() throws IOException {
			String str = "";
			str = br.readLine();
			return str;
		}
	}

}