#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;

struct segment{
    int n, seg[3 * N];
    void resize(int _n){
        n = _n;
        for(int i = 0 ; i < 2 * n ; i++){
            seg[i] = 0;
        }
    }
    void modify(int p, int val){
        for(seg[p += n] = val ; p > 1 ; p >>= 1)
            seg[p >> 1] = seg[p] + seg[p ^ 1];
    }
    int query(int l, int r){
        if(r < l) return 0;
        r++;
        int ret = 0;
        for(l += n, r += n ; l < r ; l >>= 1, r >>= 1){
            if(l & 1) ret += seg[l++];
            if(r & 1) ret += seg[--r];
        }
        return ret;
    }
};

segment tree;

ll calc(string &a, string &b){
    int n = a.size();
    vector <int> v[4];
    for(int i = n - 1 ; i >= 0 ; i--){
        v[b[i] - '0'].push_back(i);
    }
    vector <int> p(n);
    for(int i = 0 ; i < n ; i++){
        p[i] = v[a[i] - '0'].back();
        v[a[i] - '0'].pop_back();
    }
    tree.resize(n + 1);
    ll ret = 0;
    for(int i = 0 ; i < n ; i++){
        ret += tree.query(p[i] + 1, n - 1);
        tree.modify(p[i], 1);
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--){
        string s;
        cin >> s;
        int n = s.size();
        for(int i = 0 ; i < n ; i++){
            if(s[i] == 'A') s[i] = '0';
            else if(s[i] == 'N') s[i] = '1';
            else if(s[i] == 'O') s[i] = '2';
            else s[i] = '3';
        }
        vector <int> f = {0, 1, 2, 3};
        string best_str;
        ll best_value = -1;
        do{
            string t = s;
            sort(t.begin(), t.end(), [&](char l, char r){
                return f[l - '0'] < f[r - '0'];
            });
            ll c = calc(s, t);
            if(c > best_value){
                best_value = c;
                best_str = t;
            }
        } while(next_permutation(f.begin(), f.end()));
        for(int i = 0 ; i < n ; i++){
            if(best_str[i] == '0') best_str[i] = 'A';
            else if(best_str[i] == '1') best_str[i] = 'N';
            else if(best_str[i] == '2') best_str[i] = 'O';
            else best_str[i] = 'T';
        }
        cout << best_str << "\n";
    }
}
