#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo0(i,n) for(int i=0;i<n;i++)
#define fo1(i,n) for(int i=1;i<=n;i++)
#define ll long long
#define lli long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define mod 1000000007
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pl;
typedef vector<int>		vi;
typedef vector<string> vs;
typedef vector<ll>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
#define arrlen(ar) (sizeof(ar)/sizeof(ar[0]))
lli ceil_div(lli a,lli b) {
  return (a+b-1)/b;
}
int gcd(int a, int b) { // make this iterative
  if (b == 0) return a;
  return gcd(b, a % b);
}
// bool isPrime[90000001];
// void sieve() {
//    isPrime[0]=true;
//    // change 900000000 accn to your need
//    for(lli i=2;i*i<=90000000;i++) {
//        if(!isPrime[i])
//        for(lli j=i*i;j<=90000000;j+=i)
//        isPrime[j]=true;
//    }
// }
void swap(string &a,string &b) {
  string temp=a;
  a=b;
  b=temp;
}
int lcm(int a,int b) {
  return (abs(a*b)/gcd(a,b));
}
//------------------------------------------

void solve() {
  // remember to take int overflow into account. 
  string s;
  cin>>s;
  fo0(i,s.size()) {
      if(i%2==0) {
          if(s[i]=='a') s[i]='b';
          else s[i]='a';
      } else {
          if(s[i]=='z') s[i]='y';
          else s[i]='z';
      }
  }
  cout<<s<<endl;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());

    int t;
    cin>>t;
    while(t--) {
      solve();
    }

    return 0;
}
