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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    TaskC solver = new TaskC();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskC {
    private String shift(String s) {
      StringBuilder sb = new StringBuilder();
      for (int i = 0; i < s.length(); i++) {
        if (s.charAt(i) == 'a') {
          sb.append('z');
        } else {
          sb.append((char) (s.charAt(i) - 1));
        }
      }
      return sb.toString();
    }

    private String shift2(String s) {
      return s.substring(0, s.length() - 1) + 'z';
    }

    public String go(String s) {
      boolean consuming = false;
      int left = -1, right = -1;
      for (int i = 0; i < s.length(); i++) {
        if (consuming) {
          if (s.charAt(i) != 'a') {
            right = i;
          } else {
            break;
          }
        } else if (s.charAt(i) != 'a') {
          consuming = true;
          left = i;
          right = i;
        }
      }
      if (left == -1) return shift2(s);
      return s.substring(0, left) + shift(s.substring(left, right + 1)) + s.substring(right + 1);
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
      String s = in.nextLine();
      out.println(go(s));
    }

  }

  static class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream), 32768);
      tokenizer = null;
    }

    public String nextLine() {
      String str = "";
      try {
        str = reader.readLine();
      } catch (IOException e) {
        e.printStackTrace();
      }
      return str;
    }

  }
}

