/*
 * Author: Md. Mahfuzur Rahman
 * Purpose: Competitive Programming
 */

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <array>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <utility>
#include <tuple>
#include <limits>
#include <functional>
#include <chrono>
#include <random>
#include <bitset>
#include <iomanip>
using namespace std;

#define ll long long
 #define pb push_back
 #define endl '\n'
 #define nl cout << endl
 #define ff first
 #define ss second
 #define all(v) v.begin(), v.end()
 #define rall(v) v.rbegin(), v.rend()
 #define srt(v) sort(v.begin(),v.end())
 #define vii vector<int>
 #define vll vector<long long>
 #define pii pair<int, int>
 #define pll pair<long,long>
 #define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
 #define minheap priority_queue<long long, vector<long long>, greater<long long>>
 #define maxheap priority_queue<long long, vector<long long>>
const int MAX = 1e6;
const ll MOD = 1e9+7;
 
 ll mx(map<char,ll>&mp)
 {
    ll val=0;
    for(auto x:mp)
    {
        val=max(val,x.ss);
    }
    return val;
 }
 void solve()
 {  
    string s;cin>>s;
    ll n=s.size();
    map<char,ll>mp;

    for(auto x:s)mp[x]++;

    if(mx(mp)>(n+1)/2){
        cout<<-1<<endl;
        return;
    }
    string ans="";
    char last='#';

    for(ll i=0;i<n;i++)
    {
        ll det=0;

        for(char x='a';x<='z';x++)
        {
            if(mp[x]>0)
            {
                if(x!=last)
                {
                    mp[x]--;
                    if(mx(mp)<=(n-(i+1)+1)/2){
                        last=x;
                        det=1;  
                        ans+=last;
                        break;
                    }
                    else{
                        mp[x]++;
                    }
                }
            }
        }
        if(!det){
            cout<<-1<<endl;
        }
    }
    cout<<ans<<endl;


 }

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);  
    
    ll t;          
    cin>>t;
    while(t--)
    {
      solve();
    }    
    
    
}