#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const long long MAXN = 3e5 + 3;
void faster() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
bool cmp(const string& a, const string& b) { return (a + b) < (b + a); }
void solve() {
  string s;
  cin >> s;
  int cnt = 0;
  for (int i = 1; i < s.size(); i++) {
    if (s[i] == s[i - 1]) cnt++;
  }
  if (cnt == 0)
    cout << s;
  else {
    s += '0';
    for (int i = 1; i + 1 < s.size(); i++)
      if (s[i] == s[i - 1]) {
        if (s[i - 1] != 'a' && s[i + 1] != 'a') s[i] = 'a';
        if (s[i - 1] != 'b' && s[i + 1] != 'b') s[i] = 'b';
        if (s[i - 1] != 'c' && s[i + 1] != 'c') s[i] = 'c';
      }
    cout << s.substr(0, s.size() - 1);
  }
}
int main() {
  int n = 1;
  while (n--) {
    solve();
    cout << endl;
  }
}
