#include <bits/stdc++.h>
using namespace std;
 
 
const int MOD = 1e9 + 7;
const int MX = 1e6 + 10;
long long dp[MX + 100][2];
 
 
void solve(){
  string s;
  cin >> s;
  int n = s.size();
  vector<int> freq(26);
  for(char i : s) freq[i-'a']++;
  string ans;
  for(int i = 0 ; i < n ; i++){
    for(int j = 0 ; j < 26 ; j++){
      if((ans.size() == 0 || ans.back() != char(j + 'a')) && freq[j]){
        int mx = 0;
        for(int k = 0 ; k < 26 ; k++){
          if(j != k) mx = max(mx,freq[k]);
        }
        if(2 * mx - (n - i - 1) <= 1){
          ans.push_back(char(j + 'a'));
          freq[j]--;
          break;
        }
      }
    }
  }
  if(ans.size() != n) cout << -1 << endl;
  else cout << ans << endl;
  
}
 
 
 
 
int main()
{
    int t = 1;
    cin >> t;
    
    while(t--) solve();
    return 0;
}