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

void solve(){
	string s;
	cin>>s;

	int n=s.size();
	map<int,int> mp;
	for(int i=0;i<n;i++) mp[s[i]-'a']++;

	int p=0,mn=1e9;
	for(auto [k,v]:mp){
		if(v<mn){
			mn=v;
			p=k;
		}
	}


	string ans="";
	int cnt=0;
	for(int i=1;i<=n;i++){
		if((i&1)&&mp[p]){
			ans+=p+'a';
			mp[p]--;
		}
		else{
			while(!mp[cnt]||cnt==p){
				cnt++;
				if(cnt>26) cnt=0;
			}
			mp[cnt]--;
			ans+='a'+cnt;
			cnt++;
			if(cnt>26) cnt=0;
		}
	}

	if(mn==1){
		cout<<"YES\n";
		cout<<ans<<'\n';
		return;
	}

	string s1="",s2;
	for(int i=0;i<n;i++){
		s1+=ans[i];
		s2=s1;
		reverse(s2.begin(),s2.end());
		if(s1==s2){
			cout<<"NO\n";
			return;
		}
	}

	cout<<"YES\n";
	cout<<ans<<'\n';
}

int main(){
	ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);

	int t=1;
	cin>>t;
	while(t--) solve();

	return 0;
}