#include <bits/stdc++.h>

using namespace std;

void solveCase()
{
    string s; cin >> s;
    map<char, int> m;
    for (char c : s)
    {
        m[c]++;
    }
    if (m.size() >= 3)
    {
        cout << "YES\n";
        while (m.size())
        {
            auto it = m.begin();
            while (it != m.end())
            {
                it->second--; cout << it->first;
                if (it->second == 0)
                {
                    it = m.erase(it);
                }
                else
                {
                    it++;
                }
            }
        }
        cout << "\n";
    }
    else if (m.size() == 1)
    {
        if (m.begin()->second > 1)
        {
            cout << "NO\n";
        }
        else
        {
            cout << "YES\n" << m.begin()->first << "\n";
        }
    }
    else if (m.size() == 2)
    {
        char c1, c2;
        int n1, n2;
        auto it = m.begin();
        c1 = it->first;
        n1 = it->second;
        it++;
        c2 = it->first;
        n2 = it->second;
        if (min(n1, n2) == 1)
        {
            cout << "YES\n";
            if (n1 == 1)
            {
                cout << c1;
                for (int i = 0; i < n2; i++)
                {
                    cout << c2;
                }
                cout << "\n";
            }
            else
            {
                cout << c2;
                for (int i = 0; i < n1; i++)
                {
                    cout << c1;
                }
                cout << "\n";
            }
        }
        else
        {
            cout << "NO\n";
        }

    }
}

int main()
{
    int n; cin >> n; while (n--)
    {
        solveCase();
    }
    return 0;
}