// Created: 2025-07-14 21:00:35 IST
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define int long long
#define ll long long
#define cout cout<<fixed<<setprecision(0)
#define pb push_back
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define f(a,n) for(int i=0; i<n; i++){ cin>>a[i]; }
#define ff(a,l,n) for(int i=l; i<=n; i++){ cin>>a[i]; }
#define vvi vector<vector<int>>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define minpq priority_queue<ll, vector<ll>, greater<ll>> ;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void solve(){
string s; cin>>s;
int n=s.length();
map<int,int> mp;
for(int i=0; i<n; ++i){
++mp[s[i]-'a'];
}
string ans;
for(int i=0; i<n; ++i){
int c=-1;
for(auto [key,val]:mp){
if(val>(n-i)/2){
c=key;
break;
}
}
if(c>=0){
ans.pb(c+'a');
--mp[c];
if(mp[c]==0){
mp.erase(c);
}
}
else{
auto it=mp.begin();
if(i>0 &&it->first==ans[i-1]-'a'){
++it;
if(it==mp.end()){
cout<<-1<<endl;
return;
}
}
c=it->first;
ans.pb(c+'a');
--mp[c];
if(mp[c]==0){
mp.erase(c);
}
}
}
for(int i=0; i<n-1; ++i){
if(ans[i]==ans[i+1]){
cout<<-1<<endl;
return;
}
}
cout<<ans<<endl;
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
// solve();
int t; cin>>t;
for(int i=0; i<t; i++){
solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
// cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}