#include <bits/stdc++.h>
long long exp(long long x, long long y, long long p) {
  long long res = 1;
  while (y) {
    if (y % 2) res = (res * x % p) % p;
    x = (x * x) % p;
    y /= 2;
  }
  return res;
}
long long expo(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) res = (res * x % ((long long)1e9 + 7)) % ((long long)1e9 + 7);
    x = (x * x) % ((long long)1e9 + 7);
    y /= 2;
  }
  return res;
}
long long add(long long a, long long b) {
  return (a % ((long long)1e9 + 7) + b % ((long long)1e9 + 7) +
          ((long long)1e9 + 7)) %
         ((long long)1e9 + 7);
}
long long sub(long long a, long long b) {
  return (a % ((long long)1e9 + 7) - b % ((long long)1e9 + 7) +
          ((long long)1e9 + 7)) %
         ((long long)1e9 + 7);
}
long long mul(long long a, long long b) {
  return ((a % ((long long)1e9 + 7)) * (b % ((long long)1e9 + 7)) +
          ((long long)1e9 + 7)) %
         ((long long)1e9 + 7);
}
long long inv(long long x) { return expo(x, ((long long)1e9 + 7) - 2); }
using namespace std;
void solve() {
  string s;
  cin >> s;
  long long n = s.size();
  for (long long i = 1; i < n; i++) {
    if (s[i] == s[i - 1]) {
      ++s[i];
      if (s[i] > 'z') s[i] = 'a';
      if (i < n - 1) {
        if (s[i] == s[i + 1]) {
          ++s[i];
          if (s[i] > 'z') s[i] = 'a';
        }
      }
    }
  }
  cout << s << endl;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
