#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7, mod = 1e9 + 7;
string s,tmp="ANTO";
int mp[26],n;
ll f[4][4],cnt[4];
inline void solve() {
    cin>>s;
    n=s.size();
    memset(f,0,sizeof f);
    memset(cnt,0,sizeof cnt);
    for(char i:s) cnt[mp[i-'A']]+=1;
    for(int i=0; i<4; ++i) {
        ll sum(0);
        for(int j=0; j<n; ++j) {
            f[i][mp[s[j]-'A']]+=sum;
            if(s[j]==tmp[i]) sum+=1;
        }
    }
    ll mx=-1;
    vector<int>ans,v= {0,1,2,3};
    do {
        ll num(0);
        for(int i=0; i<4; ++i)
            for(int j=i+1; j<4; ++j) num+=f[v[j]][v[i]];
        if(num>mx) {
            mx=num;
            ans=v;
        }
    } while(next_permutation(v.begin(),v.end()));
    for(int &i:ans) for(int j=0; j<cnt[i]; ++j) cout<<tmp[i];
    cout<<'\n';
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int _;
    mp[0]=0,mp['N'-'A']=1,mp['T'-'A']=2,mp['O'-'A']=3;
    cin>>_;
    while(_--) solve();
    return 0;
}
