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.
from sys import stdin, stdout

s = stdin.readline().strip("\n")
start = end = None
l = list()
for n,b in enumerate(s):
	if b != "a" and not end:
		if not start:
		    start_v = n
		start = True
		l.append(chr(ord(s[n])-1))
	if b == "a" and start:
		end_v = n-1
		break
	end_v = n

if not start:
	stdout.write( s[:-1] + "z" + "\n")
else:
	stdout.write( s[:start_v] + "".join(l) + s[end_v+1:] + "\n")