#include<bits/stdc++.h>
#define ll long long
#define fastio  ios_base::sync_with_stdio(0); cin.tie(0);
#define f(i,n,a) for(i=1;i<=n;i++) cin>>a[i];
using namespace std;

ll dp[4100][4100];
ll v1[4100];

ll factor[100005];
ll fact(ll n);
ll power(ll a, ll b, ll f1)
{
 ll x=1,y=a;
 while(b > 0)
 	{
 		if(b%2 == 1)
 	{
 		x=(x*y);
 		if(x>f1) x%=f1;
 	}
 	y = (y*y);
 	if(y>f1) y%=f1;
 	b /= 2;
 	}
 return x;
}
ll fact(ll n,ll f1)
{
    return power(n,f1-2,f1);
}
ll nCr(ll n,ll r,ll f1)
{
  return (factor[n]*((fact(factor[r],f1)*fact(factor[n-r],f1))%f1))%f1;
}
template<typename T>
T ma(T x,T y)
{
    return (x>y)?x:y;
}
bool subset(vector<ll> &v,ll n,ll sum)
{
    if(sum==0)
        return true;
    if(n==0)
    return false;
    if(v[n-1]>sum)
        {
            return subset(v,n-1,sum);
        }
    return subset(v,n-1,sum)||subset(v,n-1,sum-v[n-1]);
}
ll prime[1000001];
   ll t,n,i,j,k;
int main()
{
    fastio
 ll t,n,i,j,k;
   ll ans=0;
   for (i=1;i<=1000000;i++)
    prime[i]=1;
	prime[1]=0;
	for (i=2;i*i<=1000000;i++)
	{
      if (prime[i])
      {
        for (j=i*i;j<=1000000;j=j+i)
        {
          prime[j] = 0;
        }
      }
	}

	for (i=2;i<=1000000;i++)
	{
		if (prime[i])
            ans++;
	}
	factor[0]=1;
    for(i=1;i<=100005;i++)
    {
       factor[i]=(factor[i-1]*i)%1000000007;
    }
   cin>>t;
   while(t--)
   {
       string a;
       cin>>a;
       for(i=0;i<a.size();i++)
       {
           if(i%2==0)
           {
               if(a[i]!='a')
                a[i]='a';
               else
                a[i]='b';
           }
           else
           {
               if(a[i]!='z')
                a[i]='z';
               else
                a[i]='y';
           }
       }
       cout<<a<<endl;
   }
}

