CodeForces 665C Simple Strings

C. Simple Strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

Input

aab

Output

bab

Input

caaab

Output

cabab

Input

zscoder

Output

zscoder

题目大意：给你一个字符串，如果这个字符串中有成对的字母，就改变一个字母让他们不成对

水题，但是因为strlen然后T了好几发，以后遇到这种题，最好先定义一个变量储存字符串的长度，不然每次循环计算一次会T的很惨

#include<iostream>
#include<cstring>
using namespace std;
int main(){
	char str[200010];
	cin>>str;
	int len=strlen(str);
	int sum,flag;
	char temp;
	for(int i=0;i<len;i++){
		sum=1;
		flag=i;
		while(str[i]==str[i+1]){
			sum++;
			i++;
		}
		for(int j=flag+1;j<=i;j+=2){
			temp='a';
			str[j]=temp;
			while(str[j]==str[j+1]||str[j]==str[j-1]){
				temp++;
				str[j]=temp;
			}
		}
	}
	cout<<str<<endl;
}