#include <bits/stdc++.h>
using namespace std;
char findunique(int st, int e, string s) {
  if (st == 0) st++;
  if (e == s.length() - 1) e--;
  for (int i = 0; i < 26; i++) {
    char x = char(i + 'a');
    if (x != s[st - 1] && x != s[st] && x != s[e + 1]) return x;
  }
}
int main() {
  string s;
  cin >> s;
  set<pair<int, int> > repeat;
  int x = -1;
  bool flag = false;
  for (int i = 0; i < s.length() - 1; i++) {
    if (s[i] == s[i + 1] && !flag) {
      x = i;
      flag = true;
    } else if (x != -1 && s[i] != s[i + 1]) {
      repeat.insert({x, i});
      x = -1;
      flag = false;
    }
  }
  if (x != -1) repeat.insert({x, s.length() - 1});
  for (auto pairs : repeat) {
    int start = pairs.first, finish = pairs.second;
    char c = findunique(start, finish, s);
    for (int i = start + 1; i <= finish; i += 2) s[i] = c;
  }
  cout << s;
}
