#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int maxn = 2e5 + 5;
int n;
char s[maxn];
int main() {
  scanf("%s", &s);
  n = strlen(s);
  for (int i = (1); i < (n); ++i)
    if (s[i] == s[i - 1])
      s[i] = (s[i + 1] == 'a' + (s[i] - 'a' + 1) % 26)
                 ? ('a' + (s[i] - 'a' + 2) % 26)
                 : ('a' + (s[i] - 'a' + 1) % 26);
  printf("%s\n", s);
  return 0;
}
