#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

void solve() {
    string S;
    cin >> S;
    vector<int> cnt(26, 0);
    for (char& c : S) cnt[c - 'a']++;
    vector<pair<int, char>> v;
    for (int i = 0; i < 26; i++) {
        if (cnt[i] == 0) continue;
        v.emplace_back(cnt[i], char('a' + i));
    }
    ranges::sort(v);

    int len = v.size();
    if (v.front().first > 1 and len <= 2) {
        cout << "NO\n";
        return;
    }
    cout << "YES\n";
    if (len == 1) {
        cout << S << "\n";
        return;
    }

    string T = "";
    T += v[0].second;
    v[0].first--;
    for (int i = 1; i < len; i++) {
        for (int j = 0; j < v[i].first; j++) T += v[i].second;
        if (v[0].first > 0) {
            T += v[0].second;
            v[0].first--;
        }
    }

    cout << T << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int t;
    cin >> t;
    for (; t--;) solve();
    return 0;
}