#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 5;
int dp[mx][26], id[mx][26];
int main() {
  string s;
  cin >> s;
  int n = s.size();
  for (int i = 0; i <= n; i++)
    for (int j = 0; j < 26; j++) dp[i][j] = 2 * n + 1;
  for (int i = 0; i < 26; i++) dp[0][i] = 0;
  for (int i = 1; i <= n; i++) {
    int cur = s[i - 1] - 'a';
    for (int last = 0; last < 26; last++) {
      for (int newCur = 0; newCur < 26; newCur++) {
        if (newCur == last) continue;
        if (dp[i - 1][last] + (newCur != cur) < dp[i][newCur]) {
          dp[i][newCur] = dp[i - 1][last] + (newCur != cur);
          id[i][newCur] = last;
        }
      }
    }
  }
  int ind = int(min_element(dp[n], dp[n] + 26) - dp[n]);
  char ans[n + 1];
  for (int i = n; i > 0; ind = id[i][ind], i--) {
    ans[i - 1] = char('a' + ind);
  }
  ans[n] = '\0';
  puts(ans);
  return 0;
}
