#include <bits/stdc++.h>
using namespace std;
int myInputInt;
long long int myInputLL;
inline long long int _LL() {
  scanf("%lld", &myInputLL);
  return myInputLL;
}
long long int bigMod(long long int A, long long int P, int M) {
  long long int R = 1;
  for (A %= M; P; P >>= 1) {
    if (P & 1) R = (R * A) % M;
    A = (A * A) % M;
  }
  return R;
}
long long int bigMul(long long int A, long long int B, long long int M) {
  long long int R = 0;
  for (A %= M; B; B >>= 1) {
    if (B & 1) R = (R + A) % M;
    A = (A + A) % M;
  }
  return R;
}
long long int negMod(long long int A, long long int B) {
  return (((A % B) + B) % B);
}
unsigned long long int _pow(unsigned long long int A, int P) {
  unsigned long long int R = 1;
  for (; P; P >>= 1) {
    if (P & 1) R = (R * A);
    A = (A * A);
  }
  return R;
}
template <class T>
T GCD(T x, T y) {
  while (x) x ^= y ^= x ^= y %= x;
  return y;
}
inline int _Int() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  int x = 0;
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1);
    x += c - 48;
    c = getchar();
  }
  return x;
}
int Case = 0;
const int M = 22;
char s[200000 + 7];
void Main() {
  scanf("%s", s);
  int n = strlen(s);
  int x = 0, y;
  while (x < n) {
    y = x;
    while ((y + 1) < n && s[x] == s[y + 1]) y++;
    int cnt = y - x + 1;
    if (cnt > 1) {
      for (int i = x + 1; i <= y; i += 2) {
        for (char c = 'a'; c <= 'z'; c++)
          if (s[i - 1] != c && s[i + 1] != c) {
            s[i] = c;
            break;
          }
      }
    }
    x = y + 1;
  }
  printf("%s\n", s);
}
int main() {
  Main();
  return 0;
}
