#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ull = unsigned long long;
#define ff(x) fixed << setprecision(x)
#define vel vector<long long>
#define vei vector<int>
#define ves vector<string>
#define asn ans
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr db EPS = 1.0e-9;
constexpr ll MOD = 998244353LL;
constexpr ll SZ = 1e6;
constexpr ll MAXN5 = 2e5 + 5;
constexpr ll MAXN6 = 2e6 + 5;
ll n, m;
ll ch[26];
void Solve(void) {
    string s;
    cin >> s;
    fill(ch, ch + 26, 0);
    // cout<<s;
    for (auto c : s) {
        ch[c - 'a']++;
    }
    vector<pair<ll, char>> v;
    for (int i = 0; i < 26; i++) {
        if (ch[i] != 0) {
            v.push_back({ch[i], char('a' + i)});
        }
    }
    sort(v.begin(), v.end());
    string ans;
    for (int i = 1; i < v.size(); i++) {
        for (int j = 0; j < v[i].first; j++) {
            ans = ans + v[i].second;
        }
    }
    for (int i = 1; i < v[0].first; i++) {
        ans = ans + v[0].second;
    }
    ans = v[0].second + ans;
    string ans1 = ans;
    reverse(ans.begin(), ans.end());
    if (ans == ans1 && ans.size() != 1) {
        cout << "NO" << '\n';
    } else {
        cout << "YES" << '\n';
        cout << ans1 << '\n';
    }
}
int main(void) {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    // 	freopen("mine.in", "r", stdin);
    // 	freopen("mine.out", "w", stdout);

    int cas = 1;
    cin >> cas;
    while (cas--)
        Solve();
    return 0;
}