CF665C.Simple Strings

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!

zscoder 喜欢简单的字符串！若字符串 $t$ 中每一对相邻字符均不相同，则称 $t$ 是简单的。例如，ab、aba、zscoder 是简单的，而 aa、add 则不是简单的。

zscoder 得到了一个字符串 $s$。他希望修改最少数量的字符，使得字符串 $s$ 变为简单。请帮助他完成这项任务！

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

仅一行，包含字符串 $s$（$1 ≤ |s| ≤ 2·10^5$）——即给定给 zscoder 的字符串。字符串 $s$ 仅由小写英文字母组成。

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.

输出简单字符串 $s'$ —— 即对字符串 $s$ 进行最少次数修改后得到的字符串。若存在多种解，输出任意一种即可。

注意：字符串 $s'$ 也必须仅由小写英文字母组成。