#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 55;
const int mod = 1e9 + 7;


int t , n , m ,ans;
char s[N];
int a[N];

void solve(){
    cin>>s + 1;
    int len = strlen( s + 1);
    int flag = 1; // 1 : smaller
    int cnt = 0;
    while( cnt < len ){
        if( cnt < len){
            for(int i = 1;i <= len; ++ i){
                if( !a[i] ) {
                    a[i] = 1 , ++cnt ;
                    if( s[i] != 'a' ) s[i] = 'a' ;
                    else s[i] = 'b' ;
                    break;
                }
            }
        }
        if( cnt < len){
            for(int i = 1;i <= len; ++ i){
                if( !a[i] ) {
                    a[i] = 1 , ++cnt;
                    if( s[i] != 'z' ) s[i] = 'z' ;
                    else s[i] = 'y';
                    break;
                }
            }
        }
    }
    for(int i = 1;i <= len; ++ i) cout<<s[i];
    memset(a ,0 , sizeof(a) );
    cout<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>t;
    while( t -- ) solve();
    return 0;
}
