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.
//package p708A;

import java.util.Scanner;
import java.util.StringTokenizer;

public class LettersCyclicShift {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		
		StringTokenizer tokenizer = new StringTokenizer(s, "a");
		String subStr = tokenizer.hasMoreTokens()? tokenizer.nextToken() : null;
	
		if(subStr == null)
		{
			if(s.length() == 1) System.out.println('z');
			else System.out.println(s.substring(0, s.length()-1) + 'z');
			
			System.exit(0);
		}
		
		int st = s.indexOf(subStr);
		int end = st + (subStr.length()-1);
		
		char[] str = new char[(end-st)+1];
		for(int i=st, j=0; i<=end; i++, j++)
			str[j] = (char) (s.charAt(i)-1);
		
		if(st > 0)
			System.out.print(s.substring(0, st));
		System.out.print(String.valueOf(str));
		if(end < s.length()-1)
			System.out.print(s.substring(end+1, s.length()));
		
	}

}
