#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(),vec.end()
#define umap __gnu_pbds::gp_hash_table
using ll = long long;
using db = double;
#define Emu Smile
using namespace std;

void chmax(auto &a, auto b) { if (a < b) a = b; }
void chmin(auto &a, auto b) { if (a > b) a = b; }
inline int lbt(int x) { return x & (-x); }

const ll inf = 1e16;

void solve() {
	auto fail = [&]() {
		cout << "NO\n";
	};
	auto print = [&](string_view s) {
		cout << "YES\n" << s << '\n';
	};
	string s; cin >> s;
	const int n = sz(s);
	if (n == 1) { return print(s); }
	array<int,26> a{};
	for (int i = 0; i < n; ++i) {
		a[s[i] - 'a'] ++;
	}
	vector<pair<int,int>> p;
	for (int i = 0; i < 26; ++i) {
		if (a[i]) p.emplace_back(i, a[i]);
	}
	if (sz(p) > 2) {
		string t;
		t.push_back(p[sz(p)-1].first + 'a');
		p[sz(p)-1].second --;
		for (int i = 0; i < sz(p); ++i) {
			t += string(p[i].second, p[i].first + 'a');
		}
		return print(t);
	} else {
		if (p[0].second > p[1].second) swap(p[0], p[1]);
		if (p[0].second == 1) {
			string t;
			for (int i = 0; i < sz(p); ++i) {
				t += string(p[i].second, p[i].first + 'a');
			}
			return print(t);
		} else {
			return fail();
		}
	}

}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

//	init();

	cout << fixed << setprecision(2);

	int OuO = 1;
	cin >> OuO;
	for (int piastic = 0; piastic < OuO; ++piastic) {
		solve();
	}
	return 0;
}