Codeforces 709C 模拟

C. Letters Cyclic Shift

time limit per test：1 second

memory limit per test：256 megabytes

input：standard input

output：standard output

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' 'y' 'x' 'b' 'a' '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 s₁ = t₁, s₂ = t₂, ..., s_i - 1 = t_i - 1, and s_i < t_i.

题目连接：http://codeforces.com/contest/709/problem/C

---

题意：将s的子串进行一次变换，输出字典序最小的s。

思路：水题。注意一定要进行一次变换。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
string s;
char ans[100100];
int main()
{
    int i;
    cin>>s;
    char ch;
    int sign=0,flag=0;
    for(i=0; i<s.size(); i++)
    {
        if(s[i]-1>='a') ch=s[i]-1;
        else ch='z';
        if(sign==0&&ch<=s[i]) ans[i]=ch,flag=1;
        else if(flag==0) ans[i]=s[i];
        else ans[i]=s[i],sign=1;
    }
    if(flag==0) ans[i-1]=ch;
    for(i=0; i<s.size(); i++)
        printf("%c",ans[i]);
    cout<<endl;
    return 0;
}