#include <bits/stdc++.h>
using namespace std;

template <typename A, typename B> string to_string(pair<A, B> p);
string to_string(const char& ch) { return "'" + string(1, ch) + "'"; }
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
	bool first = true; string res = "{";
	for (int i = 0; i < static_cast<int>(v.size()); i++) {
		if (!first) { res += ", "; }
		first = false; res += to_string(v[i]);
	}
	res += "}"; return res;
}
template <typename A> string to_string(A v) {
	bool first = true; string res = "{";
	for (const auto &x : v) {
		if (!first) { res += ", "; }
		first = false; res += to_string(x);
	}
	res += "}"; return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
	return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
#define output cout
void debug_out() { output << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	output << " " << to_string(H); debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define dbg(...) output << "[" << #__VA_ARGS__ << "] :", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

#define ll int64_t
#define ull uint64_t
#define lld long double
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define vt vector
#define vll vt<ll>
#define pll pair<ll,ll>
#define vpll vt<pll>
#define vvll vt<vll>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define FOR(i,n) for(ll i=0;i<n;i++)
#define ffo(i,a,b) for(ll i=a;i<=b;i++)
#define rfo(i,a,b) for(ll i=a;i>=b;i--)
#define space cout<<"\n\n";
#define endl '\n' // comment this line in interactive prob
template <typename T> using mxpq = priority_queue<T>;
template <typename T> using mnpq = priority_queue<T, vt<T>, greater<T>>;
#define fps(x,y) fixed<<setprecision(y)<<x
#define mmss(xa,v) memset(xa,v,sizeof(xa)) // use only if v = -1 or 0, else use fill
#define merg(a,b,c) set_union(a.begin(),a.end(),b.begin(),b.end(),inserter(c,c.begin()))
// https://www.techiedelight.com/merge-two-sets-set_union-merge-cpp/

template<typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2> &a) {in >> a.ff >> a.ss; return in;}
template<typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {out << a.ff << " " << a.ss; return out;}
template<typename T, typename T1>
T amax(T &a, T1 b) {if (b > a) a = b; return a;}
template<typename T, typename T1>
T amin(T &a, T1 b) {if (b < a) a = b; return a;}

int dx[4] = { -1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
// up, right, down, left

const double PI = 3.14159265359;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const ll N = 1e6 + 6;
const ll MAX_SIZE = 2e6 + 6;
const ll mod = 1e9 + 7;

ll powerM(ll x, ll y, ll M = mod) { // default argument
	ll v = 1; x = x % M; while (y > 0) {if (y & 1)v = (v * x) % M; y = y >> 1; x = (x * x) % M;} return v;
}
ll power(ll x, ll y) {
	ll v = 1; while (y > 0) {if (y & 1)v = v * x; y = y >> 1; x = x * x;} return v;
}
int largest_bit(long long x) { // based on 0-indexing
	return x == 0 ? -1 : 63 - __builtin_clzll(x);
}

const ll maxN = 1e5 + 9;

void preSolve() {
}

void solve() {
	string s;
	cin >> s;
	ll n = s.length();
	ll i = 0; ll flg = 0;
	while (i < n) {
		if (i % 2 == 0) {
			if (s[i] != 'a')
				cout << 'a';
			else
				cout << 'b';
		}
		else {
			if (s[i] != 'z')
				cout << 'z';
			else
				cout << 'y';
		}
		++i;
	}
	cout << endl;
}

int main()
{
#ifdef LOCAL
	freopen("in1.txt", "r", stdin);
	freopen("out1.txt", "w", stdout);
#endif
	FIO;
	preSolve();
	int testcases = 1;
	cin >> testcases;
	for (int caseno = 1; caseno <= testcases; ++caseno) {
		// cout << "Case #" << caseno << ": ";
		solve();
	}
	return 0;
}

// On getting WA, if you're sure about your logic but not implementation
// then try removing redundancy as much as possible

// #define _GLIBCXX_DEBUG // Use at the top of code
// cerr << "[Execution : " << (1.0 * clock()) / CLOCKS_PER_SEC << "s]\n";
// In C++, comparator should return false if its arguments are equal.
//int dx[] = {+1,-1,+0,+0,-1,-1,+1,+1}; // Eight Directions
//int dy[] = {+0,+0,+1,-1,+1,-1,-1,+1}; // Eight Directions
//int dx[]= {-2,-2,-1,1,-1,1,2,2}; // Knight moves
//int dy[]= {1,-1,-2,-2,2,2,-1,1}; // Knight moves
// For taking a complete line as input: string s; while(s == "") getline(cin, s);
// For calculating inverse modulo, raise to the power mod-2.
// For (a^b)%mod, where b is large, replace b by b%(mod-1).
// x | (x + 1) sets lowest unset bit of x
// x & (x - 1) unsets lowest set bit of x