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 C {
	public C() 
	{
		Scanner s = new Scanner();
	
		String str = s.next();
		boolean done = true;
		int count = 0;
		//: ( nonempty substring requirement!
		int lid = -1;
		boolean thereisanA = false;
		for (int i = str.length() - 1; i >= 0; i--) {
			if (str.charAt(i) != 'a') {
				done = false;
				
			}else {
				count++;
				lid = i;
				thereisanA = true;
			}
		}
		
		
		
		int i = 0;
		for (i = 0; i < str.length(); i++ ){
			if( str.charAt(i) != 'a') {
				break;
			}
		}
		int start = i;
		for (; i < str.length(); i++ ){
			if( str.charAt(i) == 'a') {
				break;
			}
		}
		int end = i;
		
		System.err.println(start + " " + end);
		StringBuffer sb = new StringBuffer();
		
		if (done) {//All a's
			sb.append(str.substring(0, str.length() - 1));
			sb.append('z');
		}
		else if (!thereisanA) {
			for (int j = 0; j < str.length(); j++) {
				sb.append((char)(str.charAt(j) - 1));
			}
		}
		else {
			for (int j = 0; j < start; j++) {
				sb.append("a");
			}
			for (int j = start; j < end; j++) {
				sb.append((char)(str.charAt(j) - 1));
			}
		
				sb.append(str.substring(end));
			
		}
		
		
		System.out.println(sb);
	}
	
	
	public static void main(String[] args) {
		new C();
	}

	public static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		public Scanner(Reader in) {
			br = new BufferedReader(in);
		}

		public Scanner() {
			this(new InputStreamReader(System.in));
		}

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

		String readNextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}