#include<bits/stdc++.h>
using namespace std;
#define ll long long

string s1,s2;

int cnt[100005][5];
int n;

int getIndex(char c)
{
    if(c == 'A') return 0;
    else if(c == 'N') return 1;
    else if(c == 'O') return 2;
    else return 3;
}
ll calc()
{
    vector<int>later[4];

    for(int i=0;i<4;i++)
    {
        int c1 = getIndex(s2[i]);
        for(int j=i+1;j<4;j++)
        {
            int c2 = getIndex(s2[j]);
            later[c1].push_back(c2);
        }
    }
    ll ans = 0LL;

    for(int i=0;i<n;i++)
    {
        int c1 = getIndex(s1[i]);
        for(int c2:later[c1])
        {
            ans += (ll) cnt[i][c2];

        }
    }

    return ans;

}
string getString(string s)
{
    string ansString = "";
    for(int i=0;i<4;i++)
    {
        int c1 = getIndex(s[i]);
        for(int j=0;j<cnt[n-1][c1];j++) ansString += s[i];
    }
    return ansString;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);


    int t,i,j,k;
    cin >> t;
    while(t--)
    {
        cin >> s1;
        s2 = "ANOT";
        n = s1.length();
        sort(s2.begin(), s2.end());

        for(i=0;i<n;i++)
        {
            for(j=0;j<4;j++)
            {
                if(i) cnt[i][j] = cnt[i-1][j];
                else cnt[i][j] = 0;
            }
            k = getIndex(s1[i]);
            cnt[i][k]++;
        }

        ll ansmax = -1LL;
        string ansString = "";

        do{

            ll ans = calc();
            if(ans > ansmax)
            {
                ansmax = ans;
                ansString = s2;
            }
        }
        while(next_permutation(s2.begin(), s2.end()));
        cout << getString(ansString) << endl;
    }



}
