Codeforces 665C

zscoder loves simple strings! A string t is called simple if every pair of adjacent characters are distinct. For example ab, aba, zscoder are simple whereas aa, add are not simple.

zscoder is given a string s. He wants to change a minimum number of characters so that the string s becomes simple. Help him with this task!

Input

The only line contains the string s (1 ≤ |s| ≤ 2·10⁵) — the string given to zscoder. The string s consists of only lowercase English letters.

Output

Print the simple string s' — the string s after the minimal number of changes. If there are multiple solutions, you may output any of them.

Note that the string s' should also consist of only lowercase English letters.

Example

Input

aab

Output

bab

Input

caaab

Output

cabab

Input

zscoder

Output

zscoder

可以说是超级大水题……taotao大佬跟我们说是贪心（黑人问号脸？？？），我还想着这个怎么贪心……（我似乎是偷偷摸摸吐槽了一波大佬？？？滑稽）

#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
string s;
int main()
{
    cin>>s;
    int len=s.length();
    for(int i=1;i<len;i++){
        if(s[i] == s[i-1]){ //如果当前这个s[i]字母（例如a）和s[i-1]重复了
            s[i]=(s[i-1]-'a'+1)%26+'a'; //就把这个字母换成a-z顺序中的下一个字母（例如a换成b）
            if(s[i] == s[i+1]) s[i]=(s[i+1]-'a'+1)%26+'a'; //如果换了之后发现和s[i+1]又重复了（例如s[i+1]=='b'）……那就再换成s[i+1]的顺序中的下一个（b换成c）
        }
    }
    cout<<s;
}