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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;

public class CF_CC {
	static FastScanner sc = new FastScanner(System.in);
	static PrintWriter out = new PrintWriter(System.out);
	
	public static void main(String[] args) {
		new CF_CC().run();
		out.close();
	}
	
	public void run(){
		char[] s = sc.next().toCharArray();
		boolean allA = true;
		for(int i = 0;i<s.length;i++){
			if(s[i]!='a'){
				allA = false;
				break;
			}
		}
		if(allA){
			s[s.length-1]='z';
			out.println(new String(s));
			return ;
		}
		if(s[0]=='a'){
			boolean isA = true;
			for(int i = 1;i<s.length;i++){
				if(s[i]=='a' && isA)
					continue;
				if(s[i]!='a'){
					isA = false;
					s[i]--;
					continue;
				}
				if(s[i]=='a' && !isA){
					out.println(new String(s));
					return ;
				}
			}
			out.println(new String(s));
			return ;
		}
		for(int i = 0;i<s.length;i++){
			if(s[i]!='a'){
				s[i]--;
			}else{
				out.println(new String(s));
				return ;
			}
		}
		out.println(new String(s));
		return ;
	}

	static class FastScanner {
		private final InputStream stream;
	    private final byte[] buf = new byte[8192];
	    private int curChar, snumChars;

	    public FastScanner(InputStream st) {
	      this.stream = st;
	    }

	    //读一个字节
	    public int read() {
	      if (snumChars == -1)
	        throw new InputMismatchException();
	      if (curChar >= snumChars) {
	        curChar = 0;
	        try {
	          snumChars = stream.read(buf);
	        } catch (IOException e) {
	          throw new InputMismatchException();
	        }
	        if (snumChars <= 0)
	          return -1;
	      }
	      return buf[curChar++];
	    }

	    public String next() {
	      int c = read();
	      while (isSpaceChar(c)) {
	        c = read();
	      }
	      StringBuilder res = new StringBuilder();
	      do {
	        res.appendCodePoint(c);
	        c = read();
	      } while (!isSpaceChar(c));
	      return res.toString();
	    }

	    public boolean isSpaceChar(int c) {
	      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	    }
	}
}
