Codeforces_#700_div_2_A.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#include "bits/stdc++.h"

#define     ll                long long
#define     ul                unsigned long long
#define     ld                long double
#define     rep(i, a, b)      for(int i=(a); i<(b); i++)
#define     repi(i, a, b)     for(int i=(a); i>(b); i--)
#define     all(x)            x.begin(), x.end()
#define     rall(x)           x.rbegin(), x.rend()
#define     db(x)             (cout<<#x<<":"<<(x)<<'\n')
#define     fastio            ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define     gcd               _gcd
#define     lcm(a,b)          __detail::__lcm(a,b)
#define     goog(tno)         cout << "Case #" << tno <<": "
#define     pb                push_back
#define     endl              "\n"
#define     iceil(n, x)       (((n) + (x) - 1) / (x))

const ll mod = 1000000007;
const ld pi = 3.1415926535897932384626433832795;
const ll INF = 1e18;

using namespace std;

void solve()
{
	string s;
	cin >> s;
	rep(i, 0, s.size())
	{
		if (i % 2 == 0)
		{
			if (s[i] - 'a' != 0)
				s[i] = 'a';
			else
				s[i] = 'b';
		}
		else
		{
			if (s[i]  != 'z')
				s[i] = 'z';
			else
				s[i] = 'y';

		}
	}
	cout << s << endl;
}

int main() {
	fastio;
	int tz = 1;
	cin >> tz;
	while (tz--)
	{
		solve();
	}
	return 0;
}