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

using ll = long long;
using ld = long double;

using pi = pair<int,int>;
using vi = vector<int>;
using si = set<int>;

#define REP(i,a)       for(int i = 0; i < a; ++i)
#define RREP(i,a)      for(int i = a-1; i >= 0; --i)
#define REPA(i,a,b)  for(int i = (a); i < (b); ++i)
#define RREPA(i,a,b) for(int i = (b)-1; i >= (a); --i)

#define mii map<int, int>
#define mci map<char, int>

#define fill(a,b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
#define bitcount __builtin_popcount
#define YesNo(condition) cout << (condition ? "Yes" : "No") << "\n"
#define YESNO(condition) cout << (condition ? "YES" : "NO") << "\n"

const ld PI = acos((ld)-1);
const ll mod = 1e9+7;
// const ll mod = 998244353;

// int lcm(int a, int b){
//     return a/(__gcd(a, b))*b;
// }

// long long binpow(long long a, long long b) {
//     a %= mod;
//     long long res = 1;
//     while (b > 0) {
//         if (b & 1)
//             res = res * a % mod;
//         a = a * a % mod;
//         b >>= 1;
//     }
//     return res;
// }

// bool isPrime(ll x){
//     if(x==2 || x==3) return 1;
//     if(x%2==0) return 0;
//     for(ll i=3; i<=sqrt(x); i += 2)
//         if(x%i==0) return 0;
//     return 1;
// }

void solve(){
	string s;
	cin >> s;
	REP(i,s.length()){
		if(i%2==0){
			if('a' == s[i]) s[i] = 'b';
			else s[i] = 'a';
		} else {
			if('z' == s[i]) s[i] = 'y';
			else s[i] = 'z';	
		}
	}
	cout << s << "\n";
}

int main(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
    cout << setprecision(12) << fixed;

    int t=1;
    cin >> t;
    while(t--) 
    solve();
}