#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long Max(long long a, long long b) { return a > b ? a : b; }
long long Min(long long a, long long b) { return a < b ? a : b; }
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = ((res % p) * (x % p)) % p;
    y = y >> 1;
    x = ((x % p) * (x % p)) % p;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string x;
  cin >> x;
  long long st, en;
  for (long long i = 0; i < x.length() - 1; i++) {
    st = i;
    for (long long j = i; j < x.length() - 1; j++) {
      if (x[i] == x[j]) {
        en = j;
      } else {
        break;
      }
    }
    for (long long j = 0; j < en - st + 1; j++) {
      if (j % 2 == 1) {
        if (j == en - st) {
          if (abs(x[st + j + 1] - x[st + j]) >= 2) {
            x[st + j] = (x[st + j] + x[st + j + 1]) / 2;
          } else {
            if (x[st + j] <= 'x') {
              x[st + j] = 'z';
            } else {
              x[st + j] = 'a';
            }
          }
        } else {
          x[st + j] = (x[st + j] + 1 - 'a') % 26 + 'a';
        }
      }
    }
    i = en;
  }
  if (x[x.length() - 1] == x[x.length() - 2]) {
    if (abs(x[x.length() - 1] - x[x.length() - 2]) >= 2) {
      x[x.length() - 1] = (x[x.length() - 1] + x[x.length() - 2]) / 2;
    } else {
      if (x[x.length() - 1] <= 'x') {
        x[x.length() - 1] = 'z';
      } else {
        x[x.length() - 1] = 'a';
      }
    }
  }
  cout << x;
  return 0;
}
