#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
const double pi = acos(-1.0);
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long C(long long n, long long k) {
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = gcd(b % a, a, x1, y1);
  y = x1;
  x = y1 - (b / a) * x1;
  return d;
}
void pfactors(long long n, vector<long long> &R) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        R.push_back(i);
        n = n / i;
      }
    }
  }
  if (n > 1) R.push_back(n);
  return;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.length();
  map<char, int> mp;
  for (int i = 1; i < s.length(); i++) {
    if (s[i] == s[i - 1]) {
      mp.clear();
      for (int j = i - 2; j <= i + 2; j++) {
        if (j >= 0 && j < n) {
          mp[s[j]]++;
        }
      }
      for (char f = 'a'; f <= 'z'; f++) {
        if (mp[f] == 0) {
          s[i] = f;
          break;
        }
      }
    }
  }
  cout << s;
  return 0;
}
