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.*;


import static java.lang.Math.*;
import static java.util.Collections.*;
import static java.util.Arrays.*;




public class AIMTechRound3Div2ProblemC {
	
	
	static class Problem {
		
		
		Scanner reader;
		PrintWriter writer;
		
		Problem() {
			
			
			reader = new Scanner(System.in);
			writer = new PrintWriter(System.out);
			
			
		}
		
		Problem(File inputFile, File outputFile) throws IOException {
			
			
			reader = new Scanner(inputFile);
			writer = new PrintWriter(outputFile);
			
			
		}
		
		void runSolution() {
			
			
			solution();
			writer.close();
			
			
		}
		
		void solution() {
			
			
			StringBuffer s = new StringBuffer(reader.next());
			for (int i = 0; i < s.length(); i++) {
				if (s.charAt(i) != 'a') {
					for (int j = i; j < s.length() && s.charAt(j) != 'a'; j++) {
						s.setCharAt(j, (char) (s.charAt(j) - 1));
					}
					writer.print(s);
					return;
				}
			}
			writer.print(s.substring(0, s.length() - 1) + 'z');
			
			
		}


	}
	
	public static void main(String args[]) throws IOException {
		
		
		Problem A = new Problem();
		//Problem A = new Problem(new File("input.txt"), new File("output.txt"));
		A.runSolution();
		
		
	}


}