/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
void ans(int rem,int n,char last,vector<int>&cnt)
{
    if(rem==0) return;
    for(char ch='a';ch<='z';ch++)
    {
        if((!cnt[ch-'a']) || ch==last) continue;
        cnt[ch-'a']--;
        int mx = 0;
        for(int i=0;i<26;i++) mx=max(mx,cnt[i]);
        if(mx <= rem/2)
        {
            cout<<ch;
            ans(rem-1,n,ch,cnt);
            break;
        }
        cnt[ch-'a']++;
    }
}

void solve()
{
    string s; cin >> s;
    int n = s.size();
    int mx =0;
    vector<int>cnt(26,0);
    for(auto e:s) cnt[e-'a']++;

    for(int i=0;i<26;i++)
    {
        if(cnt[i] > (n+1)/2) 
        {
            cout<<-1<<'\n';
            return;
        }
        mx = max(mx , cnt[i]);
    }
    ans(n,n,'A',cnt);
    cout<<'\n';
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int t; cin >> t; while(t--) solve();
}