#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

bool check(vi a){
    int is[] = {19, 7, 8, 18};
    int at[] = {19, 7, 0, 19};
    rep(i,a.size()-3){
        bool c = true;
        rep(j,4)if(a[i+j] != is[j])c = false;
        if(c) return true;
    }
    rep(i,a.size()-3){
        bool c = true;
        rep(j,4)if(a[i+j] != at[j])c = false;
        if(c) return true;
    }
    return false;
}

signed main(void) {
    int num;
    cin >> num;
    string s;
    getline(cin,s);
    while(num--){
        getline(cin,s);
        int n = s.size();
        vi v(n,INF);
        rep(i,n)if(s[i] != ' '){
            v[i] = s[i] - 'a';
        }
        rep(a,26)if(gcd(a,26) == 1)rep(b,26){
            vi t = v;
            rep(i,n)if(t[i] < INF){
                t[i] = (a*t[i]+b) % 26;
            }
            if(check(t)){
                string ans = "";
                rep(i,n){
                    if(t[i] == INF)ans += " ";
                    else ans += t[i]+'a';
                }
                cout << ans << endl;
                a = b = INF;
            }
        }
    }
}

