#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define int long long
string s;
int cnt[4],a[4];
bool vis[1000010];
int solve(string a)
{
    int res=0,pos=0,cnt=1;
    for(int i=0;i<a.size();i++)
    {
        if(i!=0&&a[i]!=a[i-1])
        {
            pos=0;
            cnt=!vis[pos];
        }
        while(s[pos]!=a[i])
        {
            pos++;
            if(!vis[pos])cnt++;
        }
        vis[pos]=true;
        res+=cnt-1;
        while(vis[pos])pos++;
    }
    return res;
}
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(cnt,0,sizeof(cnt));
        cin>>s;
        //cout<<solve("AAAATTTTTTTT")<<endl;
        //cout<<solve("TTTTTTTTAAAA")<<endl;
        string tmp="ANTO";
        for(int i=0;i<s.size();i++)
            cnt[tmp.find(s[i])]++;

        for(int i=0;i<4;i++)a[i]=i;
        int mx=-1;
        string ans;
        do{
            string ss="";
            for(int i=0;i<4;i++)
            {
                for(int j=0;j<cnt[a[i]];j++)
                    ss+=tmp[a[i]];
            }
            memset(vis,false,s.size()+2);
            int tt=solve(ss);
            if(mx<tt)
            {
                mx=tt;
                ans=ss;
            }
        }while(next_permutation(a,a+4));
        cout<<ans<<endl;
    }
}
